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 -space is unknown except in dimensions and where it is 1. The only non-trivial upper bound is due to Gravel, Elser, and Kallus (2011) who proved that for the packing density of the regular octahedron is at most . In this paper, we prove upper bounds for the packing density of the -dimensional regular cross-polytope in the case that . 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\).
Recommendations
Cites work
- A bound, and a conjecture, on the maximum lattice‐packing density of a superball
- A proof of the Kepler conjecture
- Blichfeldt's density bound revisited
- Convex Bodies The Brunn-MinkowskiTheory
- Dense packing of space with various convex solids
- Gitterpunktanzahl im Simplex und Wills'sche Vermutung
- scientific article; zbMATH DE number 3818560 (Why is no real title available?)
- scientific article; zbMATH DE number 179210 (Why is no real title available?)
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1542661 (Why is no real title available?)
- scientific article; zbMATH DE number 3217531 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- Intrinsic volumes and lattice points of crosspolytopes
- New upper bounds on sphere packings. I
- Non-linear angle-sum relations for polyhedral cones and polytopes
- On the geometrical moments of skew-regular simplices in hyperspherical space, with some applications in geometry and mathematical statistics
- Optimality and uniqueness of the Leech lattice among lattices
- Random projections of regular polytopes
- Sphere packing bounds via spherical codes
- Upper bound on the packing density of regular tetrahedra and octahedra
Cited in
(9)- On local packings of the cross-polytope
- Exponential improvements for superball packing upper bounds
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
- scientific article; zbMATH DE number 1817659 (Why is no real title available?)
- Constructive packings of cross polytopes
- A Note on Lattice Packings via Lattice Refinements
- On the packing density of Lee spheres
- A design criterion for the Rayleigh fading wiretap channel based on ^1-norm theta functions
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)