The definitive account of the recent computer solution of the oldest problem in discrete geometry.
"13" Result
Sort By:
"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 tim…
"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 tim…
The definitive account of the recent computer solution of the oldest problem in discrete geometry.
The dense packing of microscopic spheres (i.e. atoms) is the basic geometric arrangement in crystals of mono-atomic elements with weak covalent bonds, which achieves the optimal "known density" of p/v18. In 1611, Johannes Kepler had already "conjectured" that p/v18 should be the…
The Kepler conjecture, one of geometry's oldest unsolved problems, was formulated in 1611 by Johannes Kepler and mentioned by Hilbert in his famous 1900 problem list. The Kepler conjecture states that the densest packing of three-dimensional Euclidean space by equal spheres is a…
