Hostname: page-component-77f85d65b8-8wtlm Total loading time: 0 Render date: 2026-04-21T19:18:25.255Z Has data issue: false hasContentIssue false

Sphere packings in Euclidean space with forbidden distances

Published online by Cambridge University Press:  25 February 2025

Felipe Gonçalves*
Affiliation:
The University of Texas at Austin, 2515 Speedway, Austin, TX 78712, USA & IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, 22460-320, Brazil
Guilherme Vedana
Affiliation:
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, 22460-320, Brazil; E-mail: guilherme.israel@impa.br
*
E-mail: felipe.ferreiragoncalves@austin.utexas.edu (corresponding author)

Abstract

In this paper, 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 $48$, with spheres of radii r, such that no two centers $x_1$ and $x_2$ satisfy $\sqrt {\tfrac {4}{3}} < \frac {1}{2r}|x_1-x_2| <\sqrt {\tfrac {5}{3}}$, has center density less or equal than $(3/2)^{24}$. Equality occurs for periodic packings if and only if the packing is given by a $48$-dimensional even unimodular extremal lattice. This shows that any of the lattices $P_{48p},P_{48q},P_{48m}$ and $P_{48n}$ are optimal for this constrained packing problem, and gives evidence towards the conjecture that extremal lattices are optimal unconstrained sphere packings in $48$ dimensions. We also provide results for packings up to dimension $d\leq 1200$, 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.

Information

Type
Discrete Mathematics
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Table 1 Values of $c_d$ for $d=8,16,24,\ldots ,1200$. One should read it left to right top to bottom. From dimension $d=536$ onwards, computational time was too high, and we simply took $c_d=a_d-2$, which can be verified much faster. For $d<536$, the numbers ${c_d}$ give a good rational approximation of the last sign change of the function $s\mapsto \widehat H(\sqrt {s})$ from Theorem 4. These numbers can also be found in the ancillary file cnumbers on the arXiv submission of this paper (arXiv.org:2308.03925).

Figure 1

Figure 1 This is a plot of the functions $s\mapsto \widehat H(\sqrt {s})e^{\pi s}$ for $d=8$ (black), $d=24$ (blue) and $d=48$ (red), normalized so $\widehat H(0)=1$.

Figure 2

Figure 2 This is a plot of the functions $s\mapsto \widehat H(\sqrt {s})e^{\pi s}$ for $d=72$ (red) and $d=80$ (blue), normalized so $\widehat H(0)=1$. For $d=80$, we have multiplied the function by $(s+1)^2$ for aesthetic reasons.

Figure 3

Figure 3 Best configuration for $d=2$ and $K=[1,2]\cup \{4\}$.

Figure 4

Figure 4 A visualization of the graph $\mathcal {G}$ for $K=\{1,2,\beta \}$ and $3<\beta \leq 4$ via higher-dimensional embedding.