[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Linear Programs for the Kepler Conjecture

(Extended Abstract)

  • Conference paper
Mathematical Software – ICMS 2010 (ICMS 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6327))

Included in the following conference series:

Abstract

The Kepler conjecture asserts that the densest arrangement of congruent balls in Euclidean three-space is the face-centered cubic packing, which is the familiar pyramid arrangement used to stack oranges at the market. The problem was finally solved in 1998 by a long computer proof. The Flyspeck project seeks to give a full formal proof of the Kepler conjecture. This is an extended abstract for a talk in the formal proof session of ICMS-2010, which will describe the linear programming aspects of the Flyspeck project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. GLPK (GNU Linear Programming Kit), http://www.gnu.org/software/glpk/

  2. Fourer, R., Gay, D.M., Kernighan, B.W.: The AMPL book. Brooks/Cole, Monterey (2002)

    Google Scholar 

  3. Hales, T., Harrison, J., McLaughlin, S., Nipkow, T., Obua, S., Zumkeller, R.: A revision of the proof of the Kepler Conjecture. In: DCG (2009)

    Google Scholar 

  4. Hales, T.C.: Computer resources for the Kepler conjecture (2003), http://www.math.princeton.edu/~annals/KeplerConjecture/ (2005 snapshot)

  5. Hales, T.C.: The Flyspeck Project (2010), http://code.google.com/p/flyspeck

  6. Hales, T.C., Ferguson, S.P.: The Kepler conjecture. Discrete and Computational Geometry 36(1), 1–269 (2006)

    Article  MathSciNet  Google Scholar 

  7. Obua, S.: Flyspeck II: The basic linear programs, Ph.D. thesis, Technische Universität München (2008), http://deposit.d-nb.de/cgi-bin/dokserv?idn=992033632&dok_var=d1&dok_ext=pdf&filename=992033632.pdf , http://mediatum2.ub.tum.de/doc/645669/645669.pdf .

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hales, T.C. (2010). Linear Programs for the Kepler Conjecture. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15582-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15581-9

  • Online ISBN: 978-3-642-15582-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics