Estimates of the optimal density and kissing number of sphere packings in high dimensions
A. Scardicchio, F.H. Stillinger, S. Torquato

TL;DR
This paper investigates the asymptotic behavior of the maximal density of high-dimensional sphere packings, showing that a broad class of disordered packings can achieve an exponential density bound of approximately 1/2^{0.77865d}, improving upon Minkowski's classical bound.
Contribution
The authors demonstrate that the exponential density bound for high-dimensional sphere packings is more general than previously thought, applying to a wide class of disordered packings and test functions.
Findings
Exponential improvement over Minkowski's bound is achievable.
A broad class of test functions yields the same asymptotic density bound.
The asymptotic form 1/2^{0.77865d} is robust across different disordered packings.
Abstract
The problem of finding the asymptotic behavior of the maximal density of sphere packings in high Euclidean dimensions is one of the most fascinating and challenging problems in discrete geometry. One century ago, Minkowski obtained a rigorous lower bound that is controlled asymptotically by , where is the Euclidean space dimension. An indication of the difficulty of the problem can be garnered from the fact that exponential improvement of Minkowski's bound has proved to be elusive, even though existing upper bounds suggest that such improvement should be possible. Using a statistical-mechanical procedure to optimize the density associated with a "test" pair correlation function and a conjecture concerning the existence of disordered sphere packings [S. Torquato and F. H. Stillinger, Experimental Math. {\bf 15}, 307 (2006)], the putative exponential improvement was found with…
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.
