Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the hard sphere model and sphere packings in high dimensions

Published 3 Jul 2017 in math.PR, math-ph, math.MG, and math.MP | (1707.00476v2)

Abstract: We prove a lower bound on the entropy of sphere packings of $\mathbb Rd$ of density $\Theta(d \cdot 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 $\Omega(d \cdot 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+o_d(1)) \log(2/\sqrt{3}) d \cdot 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.