Best-selling in Travel Guides & Travel Stories
Save on Travel Guides & Travel Stories
- £8.26Trending at £9.14
- £9.60Trending at £9.76
- £11.99Trending at £13.34
- £6.36Trending at £6.93
- £9.91Trending at £10.07
- £11.41Trending at £14.47
- £11.51Trending at £15.73
About this product
- DescriptionThe Kepler conjecture, one of geometry's oldest unsolved problems. The Kepler conjecture states that the densest packing of three-dimensional Euclidean space by equal spheres is attained by the cannonball packing. This book centers around six papers, presenting the detailed proof of the Kepler conjecture.
- Author BiographyThomas C. Hales, Mellon Professor of Mathematics at the University of Pittsburgh, began his efforts to solve the Kepler Conjecture before 1992. He is a pioneer in the use of computer proof techniques, and he continues work on a formal proof of the Kepler Conjecture as the aim of the Flyspeck Project (F, P and K standing for Formal Proof of Kepler).Samuel P. Ferguson completed his doctorate in 1997 under the direction of Hales at the University of Michigan. In 1995, Ferguson began to work with Hales and made significant contributions to the proof of the Kepler Conjecture. His doctoral work established one crucial case of the proof, which appeared as a singly authored paper in the detailed proof.Jeffrey C. Lagarias, Professor of Mathematics at the University of Michigan, Ann Arbor, was a co-guest editor, with Gabor Fejes-Toth, of the special issue of Discrete & Computational Geometry that originally published the proof.
- Author(s)Samuel P. Ferguson,Thomas C. Hales
- PublisherSpringer-Verlag New York Inc.
- Date of Publication08/11/2011
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Note8 Tables, black and white; 11 Illustrations, color; 82 Illustrations, black and white; XIV, 456 p. 93 illus., 11 illus. in color.
- Weight724 g
- Width155 mm
- Height235 mm
- Edited byJeffrey C. Lagarias
- Edition Statement2011
This item doesn't belong on this page.
Thanks, we'll look into this.