Tight bounds on discrete quantitative Helly numbers
From MaRDI portal
Publication:2360726
DOI10.1016/j.aam.2017.04.003zbMath1369.52011arXiv1602.07839OpenAlexW2963281405MaRDI QIDQ2360726
Gennadiy Averkov, Ingo Paschke, Stefan Weltge, Bernardo González Merino, Matthias Schymura
Publication date: 4 July 2017
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.07839
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Helly-type theorems and geometric transversal theory (52A35)
Related Items
Quantitative Tverberg theorems over lattices and other discrete sets, On Helly numbers of exponential lattices, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Helly’s theorem: New variations and applications, Quantitative combinatorial geometry for concave functions, Discrete quantitative Helly-type theorems with boxes, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Tverberg theorems over discrete sets of points, A Mélange of Diameter Helly-Type Theorems, Bounds on the lattice point enumerator via slices and projections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Moving out the edges of a lattice polygon
- Strengthening lattice-free cuts using non-negativity
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Lifting properties of maximal lattice-free polyhedra
- Violator spaces: Structure and algorithms
- A quantitative Doignon-Bell-Scarf theorem
- A proof of Lovász's theorem on maximal lattice-free sets
- Quantitative Tverberg theorems over lattices and other discrete sets
- Convexity in cristallographical lattices
- A GENERALIZATION OF THE DISCRETE VERSION OF MINKOWSKI'S FUNDAMENTAL THEOREM
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- Transversal numbers over subsets of linear spaces
- Helly’s theorem: New variations and applications
- On Maximal S-Free Convex Sets
- A Geometric Perspective on Lifting
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Centerpoints: A Link Between Optimization and Convex Geometry
- Integer Programming
- Bounds for Lattice Polytopes Containing a Fixed Number of Interior Points in a Sublattice
- A Theorem Concerning the Integer Lattice
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
- Convex and Discrete Geometry
- Convex Bodies The Brunn-MinkowskiTheory
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
- The dimension of intersections of convex sets
