Sphere Packings in Euclidean Space with Forbidden Distances
arXiv:2308.03925 · doi:10.1017/fms.2025.9
Abstract
We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension , with spheres of radii , such that no two centers and satisfy , has center density less or equal than . Equality occurs for periodic packings if and only if the packing is given by a -dimensional even unimodular extremal lattice. This shows that any of the lattices and are optimal for this constrained packing problem, and gives evidence towards the conjecture that extremal lattices are optimal unconstrained sphere packings in dimensions. We also provide results for packings up to dimension , where we impose constraints on the distance between centers and on the minimal norm of the spectrum, showing that even unimodular extremal lattices are again uniquely optimal. Moreover, in the one-dimensional case, where it is not at all clear that periodic packings are among those with largest density, we nevertheless give a condition on the set of constraints that allows this to happen, and we develop an algorithm to find these periodic configurations by relating the problem to a question about dominos.
40 pages; to appear on Forum of Mathematics, Sigma;
References in corpus (7)
- New upper bounds on sphere packings I
- The sphere packing problem in dimension 24
- The sphere packing problem in dimension 8
- Fourier interpolation on the real line
- Bounds for coefficients of cusp forms and extremal lattices
- Eigenfunctions of the Fourier Transform with specified zeros
- Energy of codes with forbidden distances in 48 dimensions