Maximal $S$-Free Convex Sets and the Helly Number
From MaRDI portal
Publication:2835843
DOI10.1137/16M1063484zbMath1359.52021OpenAlexW2559328376MaRDI QIDQ2835843
Michele Conforti, Marco Di Summa
Publication date: 30 November 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1063484
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
Towards a characterization of maximal quadratic-free sets, On Helly numbers of exponential lattices, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Helly’s theorem: New variations and applications, Optimality certificates for convex minimization and Helly numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lifting properties of maximal lattice-free polyhedra
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- A geometric approach to cut-generating functions
- Convexity in cristallographical lattices
- A $(k+1)$-Slope Theorem for the $k$-Dimensional Infinite Group Relaxation
- On Maximal $S$-Free Sets and the Helly Number for the Family of $S$-Convex Sets
- Transversal numbers over subsets of linear spaces
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- On Maximal S-Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Integer Programming
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Cut-Generating Functions and S-Free Sets
