Improving Roger's upper bound for the density of unit ball packings via estimating the surface area of Voronoi cells from below in Euclidean d-space for all d 8

From MaRDI portal
Publication:1611073

DOI10.1007/S00454-001-0095-YzbMATH Open1013.52015arXivmath/0110205OpenAlexW1985846107MaRDI QIDQ1611073FDOQ1611073


Authors: Károly Bezdek Edit this on Wikidata


Publication date: 21 June 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: The sphere packing problem asks for the densest packing of unit balls in d-dimensional Euclidean space. This problem has its roots in geometry, number theory and it is part of Hilbert's 18th problem. In 1958 C. A. Rogers proved a non-trivial upper bound for the density of unit ball packings in d-dimensional Euclidean space for all d>0. In 1978 Kabatjanskii and Levenstein improved this bound for large d. In fact, Rogers' bound is the presently known best bound for 43>d>3, and above that the Kabatjanskii-Levenstein bound takes over. In this paper we improve Rogers' upper bound for the density of unit ball packings in Euclidean d-space for all d>7. We do this by estimating from below the surface area of Voronoi cells in any packing of unit balls in Euclidean d-space for all d>7.


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




Recommendations





Cited In (7)





This page was built for publication: Improving Roger's upper bound for the density of unit ball packings via estimating the surface area of Voronoi cells from below in Euclidean \(d\)-space for all \(d\geq 8\)

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