3 problems

Let $G$ be a finite graph. For every edge $e\in E(G)$, let $\sigma_e\in\mathcal{M}(\mathbb{R}^d)$ be an admissible measure. A copy of $G$ in $A\subset\mathbb{R}^d$ is a map…

Let the three interpretations denoted by … , and … , … can be used to find a shortcut for constructing these configurations. The statement is speculative and the source does not es…

Let $A$ be the incidence matrix of the complete graph $K_5$ without self-loops, namely … Let ${\mathbb N}A$ denote the semigroup generated by the columns of $A$, and for each…