Quantitative Tverberg theorems over lattices and other discrete sets
From MaRDI portal
Publication:2408215
DOI10.1007/s00454-016-9858-3zbMath1386.52004arXiv1603.05525OpenAlexW2301339721MaRDI QIDQ2408215
Reuben N. La Haye, Pablo Soberón, David Rolnick, Jesús A. De Loera
Publication date: 10 October 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05525
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Other problems of combinatorial convexity (52A37) 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, Radon numbers grow linearly, On Helly numbers of exponential lattices, BRASCAMP–LIEB INEQUALITY AND QUANTITATIVE VERSIONS OF HELLY'S THEOREM, Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem, Helly’s theorem: New variations and applications, Quantitative combinatorial geometry for continuous parameters, Tverberg’s theorem is 50 years old: A survey, Quantitative combinatorial geometry for concave functions, Proof of a conjecture of Bárány, Katchalski and Pach, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative combinatorial geometry for continuous parameters
- Partition numbers for trees and ordered sets
- A generalization of Caratheodory's theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- The partition conjecture
- Helly numbers of algebraic subsets of \(\mathbb{R}^{d}\) and an extension of Doignon's theorem
- A quantitative Doignon-Bell-Scarf theorem
- Tverberg's theorem via number fields
- A fractional Helly theorem for convex lattice sets
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Tight bounds on discrete quantitative Helly numbers
- Quantitative Tverberg theorems over lattices and other discrete sets
- Convexity in cristallographical lattices
- 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
- A Problem of Geometry in R n
- A generalization of Radon's theorem II
- On the Geometry and Computational Complexity of Radon Partitions in the Iinteger Lattice
- A Colored Version of Tverberg's Theorem
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Colourful Linear Programming and its Relatives
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization
- A Generalization of Radon's Theorem
- Integer Programs with Prescribed Number of Solutions and a Weighted Version of Doignon-Bell-Scarf’s Theorem
- Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
