Densest packings of translates of strings and layers of balls
K. B\"or\"oczky, A. Heppes, E. Makai Jr

TL;DR
This paper establishes new upper bounds for the density of packings of translates of certain string and layer configurations of unit balls in 3D and 4D, proving the first non-lattice packing density bounds in four dimensions.
Contribution
It introduces novel density bounds for packings of translates of specific string and layer structures of unit balls in 3D and 4D, including the first proof of a conjectured bound in 4D.
Findings
Maximum density for 3D packings with string configurations
Maximum density for 4D packings with layered configurations
Application of $(r,R)$-system theorem to packing problems
Abstract
Let be the union of unit balls, whose centres lie on the -axis, and are equidistant with distance . Then a packing of unit balls in consisting of translates of has a density at most , with equality for a certain lattice packing of unit balls. Let be the union of unit balls, whose centres lie on the coordinate plane, and form either a square lattice or a regular triangular lattice, of edge length . Then a packing of unit balls in consisting of translates of has a density at most , with equality for the densest lattice packing of unit balls in . This is the first class of non-lattice packings of unit balls in , for which this conjectured upper bound for the packing density of balls is proved. Our main tool for the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuasicrystal Structures and Properties · Point processes and geometric inequalities · Mathematical Approximation and Integration
