When is the ball a local pessimum for covering?

DOI10.1007/S00454-015-9690-1MaRDI QIDQ2354681zbMATH OpenOpenAlexFDO

Authors Yoav Kallus

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

zbMATH Keywords

latticeconvex bodyspherical harmonicscoveringpessimum

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)

Abstract: We consider the problem of identifying the worst point-symmetric shape for covering n-dimensional Euclidean space with lattice translates. Here we focus on the dimensions where the thinnest lattice covering with balls is known and ask whether the ball is a pessimum for covering in these dimensions compared to all point-symmetric convex shapes. We find that the ball is a local pessimum in 3 dimensions, but not so for 4 and 5 dimensions.

Recommendations

• The 3-ball is a local pessimum for packing
• Covering and packing with spheres by diagonal distortion in \(\mathbb R^n\)
• Pessimal packing shapes
• The local minima in the lattice-simplex covering problem
• Voronoĭ type criteria for lattice coverings with balls

Cites work

• scientific article; zbMATH DE number 3869218 (Why is no real title available?)
• scientific article; zbMATH DE number 783365 (Why is no real title available?)
• scientific article; zbMATH DE number 863503 (Why is no real title available?)
• scientific article; zbMATH DE number 3364397 (Why is no real title available?)
• A note on optimal unimodular lattices
• Computational approaches to lattice packing and covering problems
• Convex and Discrete Geometry
• Convolutions and multiplier transformations of convex bodies
• Extreme coverings ofn-space by spheres
• Inextensible domains
• Inhomogeneous extreme forms
• Reinhardt's problem of lattice packings of convex domains: Local extremality of the Reinhardt octagon
• The 3-ball is a local pessimum for packing
• Über die dichteste gitterförmige Lagerung kongruenter Bereiche in der Ebene und eine besondere Art konvexer Kurven

Cited in

(3)

• The local minima in the lattice-simplex covering problem
• The art of unlocking
• Pessimal packing shapes

This page was built for publication: When is the ball a local pessimum for covering?

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