A local maximizer for lattice width of 3-dimensional hollow bodies

DOI10.1016/J.DAM.2021.04.009zbMATH Open1471.52012arXiv1907.06199OpenAlexW2961923045MaRDI QIDQ2028093FDOQ2028093

Authors: Gennadiy Averkov, Giulia Codenotti, Antonio Macchia, Francisco Santos 

Publication date: 31 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: The second and fourth authors have conjectured that a certain hollow tetrahedron $Delta$ of width $2+sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture: there is a neighborhood $U$ of $Delta$ in the Hausdorff distance such that every convex body in $UsetminusDelta$ has width strictly smaller than $Delta$. 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 $3.972$ and their volume must lie in $[2.653,19.919]$.

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

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

zbMATH Keywords

lattice polytopeslattice widthflatness constanthollow bodies

Mathematics Subject Classification ID

Integer programming (90C10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07)

Cites Work

• Integral Polyhedra in Three Space
• Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
• Integer Programming with a Fixed Number of Variables
• Maximal lattice-free convex sets in linear subspaces
• Minkowski's Convex Body Theorem and Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• Title not available (Why is that?)
• Covering minima and lattice-point-free convex bodies
• Title not available (Why is that?)
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• Inequalities for the lattice width of lattice-free convex sets in the plane
• Blowing up convex sets in the plane
• Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
• Title not available (Why is that?)
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• A proof of Lovász's theorem on maximal lattice-free sets
• Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
• Classification of empty lattice 4-simplices of width larger than two
• Hollow polytopes of large width

Cited In (5)

• Hollow polytopes of large width
• Hollow lattice polytopes: latest advances in classification and relations with the width
• Lattice-free simplices with lattice width \(2d - o(d)\)
• Lattice reduced and complete convex bodies
• Lattice-width directions and Minkowski's \(3^d\)-theorem

Uses Software

• SageMath

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)