When is the ball a local pessimum for covering?
From MaRDI portal
Publication:2354681
DOI10.1007/s00454-015-9690-1zbMath1336.52023arXiv1301.5895MaRDI QIDQ2354681
Publication date: 20 July 2015
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5895
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
11H31: Lattice packing and covering (number-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The 3-ball is a local pessimum for packing
- Inextensible domains
- Computational approaches to lattice packing and covering problems
- Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
- A note on optimal unimodular lattices
- Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven
- Inhomogeneous extreme forms
- Convolutions and multiplier transformations of convex bodies
- Convex and Discrete Geometry
- Extreme coverings ofn-space by spheres