Quantitative Combinatorial Geometry for Continuous Parameters

@article{Loera2017QuantitativeCG,
  title={Quantitative Combinatorial Geometry for Continuous Parameters},
  author={Jes{\'u}s A. De Loera and Reuben N. La Haye and David Rolnick and Pablo Sober{\'o}n},
  journal={Discrete \& Computational Geometry},
  year={2017},
  volume={57},
  pages={318-334}
}
We prove variations of Carathéodory’s, Helly’s and Tverberg’s theorems where the sets involved are measured according to continuous functions such as the volume or diameter. Among our results, we present continuous quantitative versions of Lovász’s colorful Helly’s theorem, Bárány’s colorful Carathéodory’s theorem, and the colorful Tverberg’s theorem. 
Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets
TLDR
A new variation of Tverberg’s theorem is presented, given a discrete set S, and the number of points needed to guarantee the existence of an m-partition of the points such that the intersection of the m convex hulls of the parts contains at least k points of S.
The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
We discuss five discrete results: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carath\'eodory, Helly, and Tverberg from combinatorial geometry. We explore their
Tverberg’s theorem is 50 years old: A survey
This survey presents an overview of the advances around Tverberg’s theorem, focusing on the last two decades. We discuss the topological, linear-algebraic, and combinatorial aspects of Tverberg’s
Discrete quantitative Helly-type theorems with boxes
A Mélange of Diameter Helly-Type Theorems
TLDR
It is shown that a Minkowski norm admits an exact Helly-type theorem for diameter if and only if its unit ball is a polytope and a colorful version for those that do is proved.
Radon numbers grow linearly
Define the k-th Radon number rk of a convexity space as the smallest number (if it exists) for which any set of rk points can be partitioned into k parts whose convex hulls intersect. Combining the
Radon Numbers Grow Linearly
TLDR
Combining the recent abstract fractional Helly theorem of Holmsen and Lee with earlier methods of Bukh, it is proved that r_k grows linearly, i.e., $r_k\le c(r_2)\cdot k$.
Radon Numbers Grow Linearly
<jats:p>Define the <jats:italic>k</jats:italic>-th Radon number <jats:inline-formula><jats:alternatives><jats:tex-math>$$r_k$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML">
...
1
2
...

References

SHOWING 1-10 OF 50 REFERENCES
Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets
TLDR
A new variation of Tverberg’s theorem is presented, given a discrete set S, and the number of points needed to guarantee the existence of an m-partition of the points such that the intersection of the m convex hulls of the parts contains at least k points of S.
Quantitative Tverberg, Helly, & Carathéodory theorems
This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable information in the
Quantitative (p, q) theorems in combinatorial geometry
Helly's Theorem: New Variations and Applications
This survey presents recent Helly-type geometric theorems published since the appearance of the last comprehensive survey, more than ten years ago. We discuss how such theorems continue to be
Quantitative Helly-type theorems
Keywords: Helly's theorem ; intersection of convex sets ; diameter ; volume ; Steinitz' theorem Note: Professor Pach's number: [017] Reference DCG-ARTICLE-1982-001doi:10.2307/2044407 Record created
Very Colorful Theorems
TLDR
Several colorful generalizations of classical theorems in discrete geometry are proved, including Kirchberger’s theorem, which gives a generalization of the theorem of Tverberg on non-separated partitions.
Tverberg’s theorem via number fields
We show that Tverberg’s theorem follows easily from a theorem of which Bárány [1] has given a very short proof.
Optimal bounds for the colored Tverberg problem
We prove a "Tverberg type" multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Barany et al.
A Colored Version of Tverberg's Theorem
The main result of this paper is that given n red, n white, and n green points in the plane, it is possible to form n vertex-disjoint triangles Delta_{1},...,Delta_{n} in such a way that the
Helly"s theorem with volumes
Keywords: Steinitz lemma ; Helly's theorem Note: Professor Pach's number: [016] Reference DCG-ARTICLE-1984-002doi:10.2307/2322144 Record created on 2008-11-14, modified on 2017-05-12
...
1
2
3
4
5
...