ON A STRONG VERSION OF THE KEPLER CONJECTURE

DOI10.1112/S0025579312001039zbMATH Open1260.05032arXiv1111.3092OpenAlexW2153440815WikidataQ123116165 ScholiaQ123116165MaRDI QIDQ4911022FDOQ4911022

Authors: Károly Bezdek 

Publication date: 13 March 2013

Published in: Mathematika (Search for Journal in Brave)

Abstract: We raise and investigate the following problem that one can regard as a very close relative of the densest sphere packing problem. If the Euclidean 3-space is partitioned into convex cells each containing a unit ball, how should the shapes of the cells be designed to minimize the average surface area of the cells? In particular, we prove that the average surface area in question is always at least 13.8564... .

Full work available at URL: https://arxiv.org/abs/1111.3092

Recommendations

• A revision of the proof of the Kepler conjecture
• A proof of the Kepler conjecture
• A formal proof of the Kepler conjecture
• A formulation of the Kepler conjecture
• The status of the Kepler conjecture
• scientific article; zbMATH DE number 2209729
• Theorem Proving in Higher Order Logics
• A note on the Kepler problem

zbMATH Keywords

densest sphere packing problem

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Isoperimetric problems for polytopes (52B60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

• A proof of the Kepler conjecture
• A formulation of the Kepler conjecture
• Geometric measure theory. A beginner's guide. Illustrated by James F. Bredt
• Sphere packings. III: Extremal cases
• Sphere packings. IV: Detailed bounds
• Sphere packings. VI: Tame graphs and linear programs
• On totally separable packings of equal balls
• THE TOTAL LENGTH OF THE EDGES OF A POLYHEDRON
• An extension of Jung's theorem
• A new lower bound on the surface area of a Voronoi polyhedron
• Finding the best face on a Voronoi polyhedron -- the strong dodecahedral conjecture revisited

Cited In (4)

• Linear Programs for the Kepler Conjecture
• The Kepler Conjecture
• Kepler's conjecture and the dodecahedral conjecture
• On quantization with the Weaire-Phelan partition

This page was built for publication: ON A STRONG VERSION OF THE KEPLER CONJECTURE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911022)