A bound, and a conjecture, on the maximum lattice‐packing density of a superball

DOI10.1112/S0025579300013760zbMath0785.52007WikidataQ123162370 ScholiaQ123162370MaRDI QIDQ3139950

J. A. Rush

Publication date: 20 December 1993

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

densityconjectureboundconvex bodiessuperballmaximum lattice-packing

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items (4)

An indexed set of density bounds on lattice packings ⋮ Compositions of sums of absolute powers ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ The packing density of the \(n\)-dimensional cross-polytope

Cites Work

• Unnamed Item
• A lower bound on packing density
• On the packing densities of superballs and other bodies
• Thin Lattice Coverings
• Sphere Packings and Error-Correcting Codes
• On the geometry of numbers

This page was built for publication: A bound, and a conjecture, on the maximum lattice‐packing density of a superball