Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Dense Sphere Packings
A Blueprint for Formal Proofs

$76.99

Part of London Mathematical Society Lecture Note Series

  • Date Published: December 2012
  • availability: In stock
  • format: Paperback
  • isbn: 9780521617703

$76.99
Paperback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The 400-year-old Kepler conjecture asserts that no packing of congruent balls in three dimensions can have a density exceeding the familiar pyramid-shaped cannonball arrangement. In this book, a new proof of the conjecture is presented that makes it accessible for the first time to a broad mathematical audience. The book also presents solutions to other previously unresolved conjectures in discrete geometry, including the strong dodecahedral conjecture on the smallest surface area of a Voronoi cell in a sphere packing. This book is also currently being used as a blueprint for a large-scale formal proof project, which aims to check every logical inference of the proof of the Kepler conjecture by computer. This is an indispensable resource for those who want to be brought up to date with research on the Kepler conjecture.

    • Provides a significantly simplified proof of the Kepler conjecture
    • Equips the reader with knowledge of how to apply computer optimization methods to solve a family of related problems in geometry
    • Demonstrates how a new style of mathematical exposition is developing, in which mathematical claims are supported by formal proofs
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: December 2012
    • format: Paperback
    • isbn: 9780521617703
    • length: 286 pages
    • dimensions: 228 x 152 x 15 mm
    • weight: 0.42kg
    • availability: In stock
  • Table of Contents

    1. Close packing
    2. Trigonometry
    3. Volume
    4. Hypermap
    5. Fan
    6. Packing
    7. Local fan
    8. Tame hypermap
    9. Further results.

  • Author

    Thomas Hales, University of Pittsburgh
    Professor Thomas Hales is Andrew Mellon Professor at the University of Pittsburgh. He is best known for his solution to the 400-year-old Kepler conjecture and is also known for the proof of the honeycomb conjecture. He is currently helping to develop technology that would allow computers to do mathematical proofs. His honors include the Chauvenet Prize of the MAA, the R. E. Moore Prize, the Lester R. Ford Award of the MAA, the Robbins Prize of the AMS and the Fulkerson Prize of the Mathematical Programming Society.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email cflack@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×