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 \emph{no} two centers x1 and x2 satisfy 34<2r1∣x1−x2∣<35, has density less or equal than (3π/2)24/24!. Equality occurs 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. We also give 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, and show that even unimodular extremal
lattices are again uniquely optimal. Moreover, in the 1-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