19 citations · 41 across the 13 of their papers we have counts for
Showing 2002 · math.MGShow all
3 papers · 2 filters
math.MG2002★ 4 cited
The Honeycomb Problem on the Sphere
Thomas C. Hales
The honeycomb problem on the sphere asks for the perimeter-minimizing partition of the sphere into N equal areas. This article solves the problem when N=12. The unique minimizer is…
math.MG2002
Some algorithms arising in the proof of the Kepler conjecture
Thomas C. Hales
By any account, the 1998 proof of the Kepler conjecture is complex. The thesis underlying this article is that the proof is complex because it is highly under-automated. Throughout…
math.MG2002★ 3 cited
Sphere Packings in 3 Dimensions
Thomas C. Hales
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…