A local maximizer for lattice width of 3-dimensional hollow bodies
From MaRDI portal
Publication:2028093
DOI10.1016/j.dam.2021.04.009zbMath1471.52012arXiv1907.06199OpenAlexW2961923045MaRDI QIDQ2028093
Francisco Santos, Gennadiy Averkov, Giulia Codenotti, Antonio Macchia
Publication date: 31 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.06199
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Integer programming (90C10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequalities for the lattice width of lattice-free convex sets in the plane
- Blowing up convex sets in the plane
- Covering minima and lattice-point-free convex bodies
- A proof of Lovász's theorem on maximal lattice-free sets
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Symmetric Mahler's conjecture for the volume product in the \(3\)-dimensional case
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Integer Programming with a Fixed Number of Variables
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Integral Polyhedra in Three Space
- Minkowski's Convex Body Theorem and Integer Programming
- Notions of Maximality for Integral Lattice-Free Polyhedra: The Case of Dimension Three
- Classification of empty lattice 4-simplices of width larger than two
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Hollow polytopes of large width
- Algorithms in real algebraic geometry