Sphere Packings, VI. Tame Graphs and Linear Programs

Thomas C. Hales ()
Additional contact information
Thomas C. Hales: University of Pittsburgh, Department of Mathematics

Chapter 8 in The Kepler Conjecture, 2011, pp 275-337 from Springer

Abstract: Abstract This paper is the sixth and final part in a series of papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than the face-centered cubic packing. In a previous paper in this series, a continuous function f on a compact space is defined, certain points in the domain are conjectured to give the global maxima, and the relation between this conjecture and the Kepler conjecture is established. In this paper we consider the set of all points in the domain for which the value of f is at least the conjectured maximum. To each such point, we attach a planar graph. It is proved that each such graph must be isomorphic to a tame graph, of which there are only finitely many up to isomorphism. Linear programming methods are then used to eliminate all possibilities, except for three special cases treated in earlier papers: pentahedral prisms, the face-centered cubic packing, and the hexagonal-close packing. The results of this paper rely on long computer calculations.

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-1129-1_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461411291

DOI: 10.1007/978-1-4614-1129-1_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().