On the hard sphere model and sphere packings in high dimensions
Abstract
We prove a lower bound on the entropy of sphere packings of Rd of density (d · 2-d). The entropy measures how plentiful such packings are, and our result is significantly stronger than the trivial lower bound that can be obtained from the mere existence of a dense packing. Our method also provides a new, statistical-physics-based proof of the (d · 2-d) lower bound on the maximum sphere packing density by showing that the expected packing density of a random configuration from the hard sphere model is at least (1+od(1)) (2/3) d · 2-d when the ratio of the fugacity parameter to the volume covered by a single sphere is at least 3-d/2. Such a bound on the sphere packing density was first achieved by Rogers, with subsequent improvements to the leading constant by Davenport and Rogers, Ball, Vance, and Venkatesh.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.