Sphere packings I
Thomas C. Hales
Abstract
We describe a program to prove the Kepler conjecture on sphere packings. We then carry out the first step of this program. Each packing determines a decomposition of space into Delaunay simplices, which are grouped together into finite configurations called Delaunay stars. A score, which is related to the density of packings, is assigned to each Delaunay star. We conjecture that the score of every Delaunay star is at most the score of the stars in the face-centered cubic and hexagonal close packings. This conjecture implies the Kepler conjecture. To complete the first step of the program, we show that every Delaunay star that satisfies a certain regularity condition satisfies the conjecture.
Create a lesson
Related papers
Each simplex in R4 has a point with at least 14 emanating normals to its boundary
Ivan Nasonov, Gaiane Panina
Pointed Gromov-Hausdorff Distance between lp-Wedge Sums and Isometric Embeddings of l∞
Emin Abdullaev
Embedding large subsets of Wasserstein spaces into Banach spaces
Cyril Letrouit, Quentin Mérigot
A Smooth Covariogram and the Transition Between Projection Bodies
J. Haddad, C. H. Jiménez, M. Resende Guedes
Intermediate coverings, random images, and projections
Yunhao Zhao, Yingyu Zhao, Chen Zhou et al.
On the Graph Corresponding to Center of Distances of Metric Space
Oleksiy Dovgoshey, Olga Rovenska