IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4614-1129-1_8.html
   My bibliography  Save this book chapter

Sphere Packings, VI. Tame Graphs and Linear Programs

In: The Kepler Conjecture

Author

Listed:
  • Thomas C. Hales

    (University of Pittsburgh, Department of Mathematics)

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.

Suggested Citation

  • Thomas C. Hales, 2011. "Sphere Packings, VI. Tame Graphs and Linear Programs," Springer Books, in: Jeffrey C. Lagarias (ed.), The Kepler Conjecture, chapter 8, pages 275-337, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4614-1129-1_8
    DOI: 10.1007/978-1-4614-1129-1_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4614-1129-1_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.