Sphere Packings in Euclidean Space with Forbidden Distances

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 48, with spheres of radii r, such that no two centers x1 and x2 satisfy 43 < 12r|x1-x2| <53, 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 P48p,P48q,P48m and P48n 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≤ 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…