Sphere packings, codes, and kissing numbers via hard core models - Will Perkins
From Katie Gentilello
views
comments
From Katie Gentilello
We prove a lower bound on the expected size of a spherical code drawn from a "hard cap" model and the expected density of a packing drawn from the hard sphere model in high dimensions. These results allows us to improve the lower bound on the kissing number in high dimensions by a factor d and to prove new lower bounds on the entropy of sphere packings of density \Theta(d 2^{-d}) in R^d. Joint work with Matthew Jenssen and Felix Joos.
https://mediaspace.gatech.edu/media/perkins.mpg/1_1qig3dzo