Sphere Packings in Euclidean Space with Forbidden Distances

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 4848, with spheres of radii rr, such that \emph{no} two centers x1x_1 and x2x_2 satisfy 43<12rx1x2<53\sqrt{\tfrac{4}{3}} < \frac{1}{2r}|x_1-x_2| <\sqrt{\tfrac{5}{3}}, has density less or equal than (3π/2)24/24!( 3\pi /2)^{24}/24!. Equality occurs if and only if the packing is given by a 4848-dimensional even unimodular extremal lattice. This shows that any of the lattices P48p,P48q,P48mP_{48p},P_{48q},P_{48m} and P48nP_{48n} are optimal for this constrained packing problem. We also give results for packings up to dimension d1200d\leq 1200, where we impose constraints on the distance between centers and on the minimal norm of the spectrum, and show that even unimodular extremal lattices are again uniquely optimal. Moreover, in the 11-dimensional case, we give a condition on the set of constraints that allow the existence of an optimal periodic packing, and we develop an algorithm to find them by relating the problem to a question about linear domino tilings.Comment: 39 page

    Similar works

    Full text

    thumbnail-image

    Available Versions