The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if completed, will jointly comprise a proof of the conjecture. We carry out step five of the program, a proof that the local density of a certain combinatorial arrangement, the pentahedral prism, is less than that of the face-centered cubic lattice packing. We prove various relations on the local density using computer-based interval arithmetic methods. Together, these relations imply the local density bound.PhDMathematicsPure SciencesUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/130708/2/9811077.pd
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
Several results from Combinatorial Geometry [PA95] are detailed. Below are listed a number of resul...
Abstract Using graph-theoretic methods we give a new proof that for all sufficiently large n, theree...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
This paper reports on computational aspects of recent efforts to prove the Kepler conjecture. The Ke...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combina...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
AbstractWe consider the asymptotic behavior of finite sphere packings in the face centered cubic lat...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
Finding the densest sphere packing in d-dimensional Euclidean space Rd is an outstanding fundamental...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
Several results from Combinatorial Geometry [PA95] are detailed. Below are listed a number of resul...
Abstract Using graph-theoretic methods we give a new proof that for all sufficiently large n, theree...
The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which if...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
This paper reports on computational aspects of recent efforts to prove the Kepler conjecture. The Ke...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combina...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
AbstractWe consider the asymptotic behavior of finite sphere packings in the face centered cubic lat...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
Finding the densest sphere packing in d-dimensional Euclidean space Rd is an outstanding fundamental...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
Several results from Combinatorial Geometry [PA95] are detailed. Below are listed a number of resul...
Abstract Using graph-theoretic methods we give a new proof that for all sufficiently large n, theree...