Sphere Packings, I
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.
Unable to display preview. Download preview PDF.
- FT.L. Fejes T´oth, Lagerungen in der Ebene, auf der Kugel und im Raum, Springer-Verlag, Berlin, 1953.Google Scholar
- H4.T. C. Hales, Sphere packings, II, Discrete Comput. Geom., to appear.Google Scholar
- H5.T. C. Hales, Sphere packings, IIIα, in preparation.Google Scholar
- H6.T. C. Hales, Packings, http://www-personal.math.lsa.umich.edu/∼hales/packings.html
- H7.J. F. Hart et al., Computer Approximations, Wiley, New York, 1968.Google Scholar
- IEEE.IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Std. 754–1985, IEEE, New York.Google Scholar
- P.W. H. Press et al., Numerical recipes in C, Less-Numerical Algorithms, second edition, Cambridge University Press, Cambridge, 1992. Chapter 20.Google Scholar
- W.What every computer scientist should know about floating-point arithmetic, Comput. Surveys, 23(1) (1991), 5–48.Google Scholar