New dense superball packings in three dimensions

DOI10.1515/advgeom-2020-0002zbMath1470.11193arXiv1806.10878OpenAlexW2810575130MaRDI QIDQ2663677

Maria Dostert, Frank Vallentin

Publication date: 19 April 2021

Published in: Advances in Geometry (Search for Journal in Brave)

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

zbMATH Keywords

lattice packingsinterval arithmeticsuperballs

Mathematics Subject Classification ID

Nonlinear programming (90C30) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31)

Related Items (1)

Exponential improvements for superball packing upper bounds

Uses Software

• SageMath
• SciPy

Cites Work

• Unnamed Item
• Optimal simplices and codes in projective spaces
• Packing, covering and tiling in two-dimensional spaces
• On the uniform convexity of \(L^p\) and \(l^p\)
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Densest lattice packings of 3-polytopes.
• How to Calculate Shortest Vectors in a Lattice
• Convex and Discrete Geometry

This page was built for publication: New dense superball packings in three dimensions