A local maximizer for lattice width of 3-dimensional hollow bodies
From MaRDI portal
Publication:2028093
Abstract: The second and fourth authors have conjectured that a certain hollow tetrahedron of width attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture: there is a neighborhood of in the Hausdorff distance such that every convex body in has width strictly smaller than . When the search space is restricted to tetrahedra, we compute an explicit such neighborhood. We also limit the space of possible counterexamples to the conjecture. We show, for example, that their width must be smaller than and their volume must lie in .
Recommendations
- Hollow polytopes of large width
- Hollow lattice polytopes: latest advances in classification and relations with the width
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Lattice-width directions and Minkowski's \(3^d\)-theorem
- Lattice-free simplices with lattice width \(2d - o(d)\)
- On the width of a planar convex set containing zero or one lattice points
- A bound on the ratio between the packing and covering densities of a convex body
- Covering sets for plane lattices
- scientific article; zbMATH DE number 1342145
Cites work
- scientific article; zbMATH DE number 5359577 (Why is no real title available?)
- scientific article; zbMATH DE number 3987367 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3046578 (Why is no real title available?)
- A proof of Lovász's theorem on maximal lattice-free sets
- Algorithms in real algebraic geometry
- Blowing up convex sets in the plane
- Classification of empty lattice 4-simplices of width larger than two
- Covering minima and lattice-point-free convex bodies
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Hollow polytopes of large width
- Inequalities for the lattice width of lattice-free convex sets in the plane
- Integer Programming with a Fixed Number of Variables
- Integral Polyhedra in Three Space
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Maximal lattice-free convex sets in linear subspaces
- Minkowski's Convex Body Theorem and Integer Programming
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
Cited in
(5)
This page was built for publication: A local maximizer for lattice width of 3-dimensional hollow bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028093)