Author
Jenssen, M
Joos, F
Perkins, W
Journal title
FORUM OF MATHEMATICS SIGMA
DOI
10.1017/fms.2018.25
Volume
7
Last updated
2019-12-09T19:59:10.77+00:00
Abstract
We prove a lower bound on the entropy of sphere packings of $\mathbb R^d$ 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.
Symplectic ID
819451
Download URL
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000455904100001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=4fd6f7d59a501f9b8bac2be37914c43e
Publication type
Journal Article
Publication date
14 January 2019
Please contact us with feedback and comments about this page. Created on 30 Aug 2018 - 17:30.