arXiv Analytics

Sign in

arXiv:math/0205208 [math.MG]AbstractReferencesReviewsResources

Sphere Packings in 3 Dimensions

Thomas C. Hales

Published 2002-05-19Version 1

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.

Comments: 3 pages, no figures. This is a report of a Arbeitstagung lecture on June 14, 2001
Categories: math.MG
Related articles: Most relevant | Search more
arXiv:math/9811075 [math.MG] (Published 1998-11-11, updated 2002-05-20)
Sphere packings III
arXiv:math/9811073 [math.MG] (Published 1998-11-11)
Sphere packings I
arXiv:math/0605526 [math.MG] (Published 2006-05-18)
Coincidences of Hypercubic Lattices in 4 dimensions

Links

Toolbox