Improving Rogers' 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>7

dc.creatorBezdek, Karoly
dc.date2001-10-18
dc.date.accessioned2026-07-07T04:43:56Z
dc.date.available2026-07-07T04:43:56Z
dc.descriptionThe 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.
dc.descriptionto be published in Discrete and Comput. Geom
dc.identifierhttps://arxiv.org/abs/math/0110205
dc.identifierhttp://arxiv.org/abs/math/0110205
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62439
dc.subjectMetric Geometry
dc.subject52C17 (Primary) 52A40 (Secondary)
dc.titleImproving Rogers' 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>7
dc.typetext

Files

Collections