Choose $N$ unoriented lines through the origin of ${\bf R}^{d+1}$. The sum of the angles between these lines is conjectured to be maximized if the lines are distributed as evenly as possible amongst the coordinate axes of some orthonormal basis for ${\bf R}^{d+1}$. For $d \ge 2$ we embed the conjecture into a one-parameter family of problems, in which we seek to maximize the sum of the $\alpha$-th power of the renormalized angles between the lines. We show the conjecture is equivalent to this same configuration becoming the {\em unique} optimizer (up to rotations) for all $\alpha>1$. We establish both the asserted optimality and uniqueness in the limiting case $\alpha =\infty$ of mildest repulsion. The same conclusions extend to $N=\infty$,...
Consider a collection of particles interacting through an attractive-repulsive potential given as a ...
The discrepancy of a matrix $M \in \mathbb{R}^{d \times n}$ is given by $\mathrm{DISC}(M) := \min_{\...
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introd...
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance p...
It is shown that if $\gamma: [a,b] \to S^2$ is $C^3$ with $\det(\gamma, \gamma', \gamma'') \neq 0$, ...
We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point confi...
In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the su...
The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \m...
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
We obtain a new formula for the Loewner energy of simple curves of the sphere as the renormalised en...
For a collection of $N$ unit vectors ${X}=\{x_i\}_{i=1}^N$, define the $p$-frame energy of ${X}$ as ...
A balanced configuration of points on the sphere $S^2$ is a (finite) set of points which are in equi...
AbstractWe define a new class of knot energies (known as renormalization energies) and prove that a ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Consider a collection of particles interacting through an attractive-repulsive potential given as a ...
The discrepancy of a matrix $M \in \mathbb{R}^{d \times n}$ is given by $\mathrm{DISC}(M) := \min_{\...
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introd...
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance p...
It is shown that if $\gamma: [a,b] \to S^2$ is $C^3$ with $\det(\gamma, \gamma', \gamma'') \neq 0$, ...
We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point confi...
In the paper the Fermat-Torricelli problem is considered. The problem asks a point minimizing the su...
The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \m...
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2...
We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac...
We obtain a new formula for the Loewner energy of simple curves of the sphere as the renormalised en...
For a collection of $N$ unit vectors ${X}=\{x_i\}_{i=1}^N$, define the $p$-frame energy of ${X}$ as ...
A balanced configuration of points on the sphere $S^2$ is a (finite) set of points which are in equi...
AbstractWe define a new class of knot energies (known as renormalization energies) and prove that a ...
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to findthe minimum number of dis...
Consider a collection of particles interacting through an attractive-repulsive potential given as a ...
The discrepancy of a matrix $M \in \mathbb{R}^{d \times n}$ is given by $\mathrm{DISC}(M) := \min_{\...
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introd...