On the hard sphere model and sphere packings in high dimensions
arXiv:1707.00476 · doi:10.1017/fms.2018.25
Abstract
We prove a lower bound on the entropy of sphere packings of of density . 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 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 when the ratio of the fugacity parameter to the volume covered by a single sphere is at least . 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.
References in corpus (17)
- Mean field theory of hard sphere glasses and jamming
- Glass and Jamming Transitions: From Exact Results to Finite-Dimensional Descriptions
- The sphere packing problem in dimension 24
- The sphere packing problem in dimension 8
- Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes
- A conceptual breakthrough in sphere packing
- Improved sphere packing lower bounds from Hurwitz lattices
- Sphere packing bounds via spherical codes
- On the average size of independent sets in triangle-free graphs
- Cluster expansion in the canonical ensemble
- The analyticity region of the hard sphere gas. Improved bounds
- Independent Sets, Matchings, and Occupancy Fractions
- Translation-invariance of two-dimensional Gibbsian point processes
- The structure of the hard sphere solid
- Disagreement percolation for the hard-sphere model
- Lower Bounds on the Critical Density in the Hard Disk Model via Optimized Metrics
- A Lower Bound on the Density of Sphere Packings via Graph Theory