Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
From MaRDI portal
Publication:4602859
DOI10.1137/16M1100095zbMath1431.52010arXiv1512.07126MaRDI QIDQ4602859
Robert Hildebrand, Rico Zenklusen, Stephen R. Chestnut
Publication date: 7 February 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07126
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Lattices and convex bodies (number-theoretic aspects) (11H06) Helly-type theorems and geometric transversal theory (52A35)
Related Items
Tight bounds on discrete quantitative Helly numbers ⋮ Quantitative Tverberg theorems over lattices and other discrete sets ⋮ Discrete quantitative Helly-type theorems with boxes ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for mixed-integer convex minimization
- Moving out the edges of a lattice polygon
- The minimum area of convex lattice \(n\)-gons
- Lower bounds on the sizes of integer programs without additional variables
- Arithmetical progressions and the number of sums
- On defining sets of vertices of the hypercube by linear inequalities
- The convex hull of the integer points in a large ball
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- Planar sets containing no three collinear points and non-averaging sets of integers
- Roth's theorem in many variables
- Tight bounds on discrete quantitative Helly numbers
- Convexity in cristallographical lattices
- Über Integrale auf konvexen Körpern. I, II
- ARITHMETIC PROGRESSIONS IN SETS OF SMALL DOUBLING
- 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
- Three-term arithmetic progressions and sumsets
- Midpoints of Diagonals of Convex n-Gons
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem
- A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points
This page was built for publication: Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
