Kepler conjecture
In three-dimensional Euclidean space, no arrangement of equal, non-overlapping spheres has a density greater than , the density of the face-centered cubic and hexagonal close packings — the familiar way grocers stack oranges or cannonballs.
Hales announced a proof in 1998 (with Samuel Ferguson) combining a classical reduction to finitely many local configurations with an exhaustive computer search — linear-programming bounds checked on roughly 5,000 cases. A panel of twelve referees reported in 2003 that they were "99% certain" the proof was correct but could not verify every computer calculation by hand, so the Annals of Mathematics published it in 2005 with that caveat noted. The Flyspeck project, led by Hales, then built a complete formal proof checked line by line by the HOL Light and Isabelle proof assistants, removing the remaining doubt; Flyspeck was announced complete in 2014, and the formal proof was published in 2017.
The same question in other dimensions is far harder in general, but two striking cases were settled using related linear-programming and modular-form techniques: Maryna Viazovska proved the lattice is the densest sphere packing in 8 dimensions in 2016, and with coauthors settled the Leech lattice in 24 dimensions the same year. The closely related kissing-number problem (how many equal spheres can touch one sphere) is solved only in dimensions 1, 2, 3, 4, 8 and 24. Packing problems for convex bodies other than spheres, and packings in non-Euclidean or higher-dimensional spaces, remain active research areas.
References
- Thomas C. Hales (2005). A proof of the Kepler conjecture · DOI:10.4007/annals.2005.162.1065
- Thomas Hales, Mark Adams, Gertrud Bauer, et al. (2017). A formal proof of the Kepler conjecture · DOI:10.1017/fmp.2017.1
- George G. Szpiro (2003). Kepler's Conjecture: How Some of the Greatest Minds in History Helped Solve One of the Oldest Math Problems in the World