2015/03/20 by Jesús A. De Loera, R. N. La Haye, De Loera, J. A. +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Metric Geometry (math.MG) #Point processes and geometric inequalities
paper · pdf · doi:10.48550/arxiv.1503.06116
openalex publication_date 2015/03/20 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.