New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry

Abstract

In this paper we determine new upper bounds for the maximal density of translative packings of superballs in three dimensions (unit balls for the $l_3^p$-norm) and of Platonic and Archimedean solids having tetrahedral symmetry. Thereby, we improve Zong's recent upper bound for the maximal density of translative packings of regular tetrahedra from $0.3840\dots$ to $0.3745\dots$, getting closer to the best known lower bound of $0.3673\dots$ We apply the linear programming bound of Cohn and Elkies which originally was designed for the classical problem of densest packings of round spheres. The proofs of our new upper bounds are computational and rigorous. Our main technical contribution is the use of invariant theory of pseudo-reflection groups in polynomial optimization.

30 pages, 6 tables, 3 figures, (v3) comments of referees incorporated

References in corpus (19)

• Dense Packings of the Platonic and Archimedean Solids
• Symmetry groups, semidefinite programs, and sums of squares
• New upper bounds on sphere packings I
• The sphere packing problem in dimension 24
• The sphere packing problem in dimension 8
• Universally optimal distribution of points on spheres
• Crystalline Assemblies and Densest Packings of a Family of Truncated Tetrahedra and the Role of Directional Entropic Forces
• Dense Packings of Polyhedra: Platonic and Archimedean Solids
• Phase diagram of colloidal hard superballs: from cubes via spheres to octahedra
• Optimal Packings of Superballs
• Dense Regular Packings of Irregular Non-Convex Particles
• Dense crystalline dimer packings of regular tetrahedra
• The Kepler conjecture
• Sphere packing bounds via spherical codes
• Upper bounds for packings of spheres of several radii
• Upper bound on the packing density of regular tetrahedra and octahedra
• Some properties of optimal functions for sphere packing in dimensions 8 and 24
• Computing upper bounds for the packing density of congruent copies of a convex body
• The packing density of the $n$-dimensional cross-polytope

Cited by in corpus (7)

• Basic Understanding of Condensed Phases of Matter via Packing Models
• $k$-point semidefinite programming bounds for equiangular lines
• Computing upper bounds for the packing density of congruent copies of a convex body
• Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
• Solving clustered low-rank semidefinite programs arising from polynomial optimization
• New dense superball packings in three dimensions
• Semidefinite programming bounds for error-correcting codes