Optimality and uniqueness of the Leech lattice among lattices

Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8

We show that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. We show that a similar result is false for the root lattice E8. For this we construct a less dense covering lattice whose Delone subdivision has a common refinement with the Delone subdivision of E8. The new lattice yields a sphere covering which is more than 12% less dense than the formerly best known given by the lattice A8*. Currently, the Leech lattice is the first and only known example of a locally optimal lattice covering having a non-simplicial Delone subdivision. We hereby in p…

Universal optimality of the $E_8$ and Leech lattices and interpolation formulas

We prove that the $E_8$ root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions $8$ and $24$, respectively. In other words, they minimize energy for every potential function that is a completely monotonic function of squared distance (for example, inverse power laws or Gaussians), which is a strong form of robustness not previously known for any configuration in more than one dimension. This theorem implies their recently shown optimality as sphere packings, and broadly generalizes it to allow for long-range interactions. The proo…

Optimality and uniqueness of the (4,10,1/6) spherical code

Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show that the Petersen code, which consists of the midpoints of the edges of the regular simplex in dimension 4, is the unique (4,10,1/6) spherical code.

$D_4$ 根系的最优性与唯一性

Optimality and uniqueness of the $D_4$ root system

本文通过半定规划求解 Lasserre 层级第二层，证明了 $D_4$ 根系是 $\mathbb R^4$ 中唯一的接触数最优构型，并将 $\mathbb R^6$ 的接触数上界改进至 $77$。