The packing density of the $n$-dimensional cross-polytope

Abstract

The packing density of the regular cross-polytope in Euclidean $n$-space is unknown except in dimensions $2$ and $4$ where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for $n=3$ the packing density of the regular octahedron is at most $1-1.4\dots \times 10^{-12}$. In this paper, we prove upper bounds for the packing density of the $n$-dimensional regular cross-polytope in the case that $n\ge 7$. We use a modification of Blichfeldt's method due to G. Fejes Tóth and W. Kuperberg (1993).

References in corpus (7)

• Dense Packings of the Platonic and Archimedean Solids
• New upper bounds on sphere packings I
• Dense Packings of Polyhedra: Platonic and Archimedean Solids
• New upper bounds on sphere packings II
• Optimality and uniqueness of the Leech lattice among lattices
• Sphere packing bounds via spherical codes
• Upper bound on the packing density of regular tetrahedra and octahedra

Cited by in corpus (3)

• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Computing upper bounds for the packing density of congruent copies of a convex body
• Exponential improvements for superball packing upper bounds