When is the ball a local pessimum for covering?
The paper addresses the problem of identifying the worst point-symmetric shape for covering \(n\)-dimensional Euclidean space with lattice translates. It is shown that the ball is a local pessimum in dimension \(n=3\), and extensible for dimensions \(n=4\) and \(n=5\). One of the main results is given by the following Theorem: There exists \(\epsilon>0\) such that if a convex body \(K\) is a non-ellipsoidal origin-symmetric convex body and \((1-\epsilon)B^3 \subseteq K \subseteq (1+\epsilon)B^3\), then \(\vartheta(K)< \vartheta(B^3)\). In this theorem, \(B^3\) is the unit \(3\)-dimensional ball and \(\vartheta(K)\) is the optimal covering fraction for \(K\). The author also proposes the following Conjecture: For all origin-symmetric convex bodies \(K\subseteq {\mathbb R}^3\) that are not ellipsoids, \(\vartheta(K)< \vartheta(B^3)\).
- 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
- 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?)
- 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
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)