This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project
Hodographs for the Kepler problem are circles. This fact, known for almost two centuries, still prov...
The unitary S-code description of the one-body Kepler problem is shown to unfold naturally from a pr...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
This paper reports on computational aspects of recent efforts to prove the Kepler conjecture. The Ke...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give...
This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give...
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 if...
Contains fulltext : 176365.pdf (publisher's version ) (Open Access
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
Hodographs for the Kepler problem are circles. This fact, known for almost two centuries, still prov...
The unitary S-code description of the one-body Kepler problem is shown to unfold naturally from a pr...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
This paper reports on computational aspects of recent efforts to prove the Kepler conjecture. The Ke...
. The Hales program to prove the Kepler conjecture on sphere packings consists of five steps, which ...
This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give...
This article gives an introduction to a long-term project called Flyspeck, whose purpose is to give...
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 if...
Contains fulltext : 176365.pdf (publisher's version ) (Open Access
Abstract. This paper is the first in a series of six papers devoted to the proof of the Kepler conje...
If you pour unit spheres randomly into a large container, you will fill only some 55 to 60 percent o...
An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper c...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
Packing problems are concerned with filling the space with copies of a certain object, so that the l...
Hodographs for the Kepler problem are circles. This fact, known for almost two centuries, still prov...
The unitary S-code description of the one-body Kepler problem is shown to unfold naturally from a pr...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...