Quantitative Tverberg theorems over lattices and other discrete sets

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ 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 proofs of the main results require new quantitative versions of Helly's and Carath\'eodory's theorems.Comment: 16 pages. arXiv admin note: substantial text overlap with arXiv:1503.0611

Quantitative Tverberg, Helly, & Carath\'eodory 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 hypothesis and the conclusion. Typical measurements include the volume, the diameter, or the number of points in a lattice.Comment: 33 page