The packing density of the n-dimensional cross-polytope

From MaRDI portal
Publication:2354679



Abstract: The packing density of the regular cross-polytope in Euclidean n-space is unknown except in dimensions 2 and 4 where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for n=3 the packing density of the regular octahedron is at most 1−1.4ldotsimes10−12. In this paper, we prove upper bounds for the packing density of the n-dimensional regular cross-polytope in the case that ngeq7. We use a modification of Blichfeldt's method due to G. Fejes T'oth and W. Kuperberg (1993).


The authors prove that the packing density of an \(n\)-dimensional cross-polytope tends to zero exponentially fast in \(n\). They also prove that this density is strictly less than one for \(n\geq 7\).





Describes a project that uses

Uses Software






This page was built for publication: The packing density of the \(n\)-dimensional cross-polytope

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