Sphere Packings in 3 Dimensions
Thomas C. Hales
Abstract
This short note describes the tentative form of a finite-dimensional optimization problem that may be of use in a second-generation proof of the Kepler conjecture. In the original 1998 proof of the Kepler conjecture, the form of the optimization problem was constrained by limits to computer power and by the speed of the algorithms that were available in 1994 to prove inequalities by computer. The computational resources have changed considerably since then, and much has been learned by an analysis of the 1998 proof. This analysis has lead to the proposed new form for an optimization problem.
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