2000 character limit reached
Quantitative Tverberg, Helly, & Carathéodory theorems
Published 20 Mar 2015 in math.MG and math.CO | (1503.06116v3)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.