Quantitative selection theorems

TL;DR

This paper develops new volumetric selection theorems replacing points with large-volume sets, leading to improved bounds in volumetric weak epsilon-nets and $(p,q)$-theorems, and introduces volumetric variants of classical geometric theorems.

Contribution

It introduces volumetric versions of selection theorems, including the first for $(d+1)$-tuples, and improves bounds for volumetric weak epsilon-nets and $(p,q)$-theorems.

Findings

Reduced the upper bound for volumetric weak epsilon-nets to $O_d(\e^{-(d+1)})$

Established volumetric versions of Tverberg and homogeneous point selection theorems

Proved volumetric selection theorems for diameter and volume

Abstract

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem which replace the points by sets of large volume, including the first volumetric selection theorem for $(d+1)$-tuples. As consequences, we significantly decrease the upper bound for the number of sets necessary in a volumetric weak $\epsilon$-net, from $O_d(\epsilon^{-d^2(d+3)^2/4})$ to $O_d(\epsilon^{-(d+1)})$, and substantially reduce the the piercing number for volumetric $(p,q)$-theorems. We also prove a volumetric version of the homogeneous point selection theorem. To do so, we introduce a volumetric same-type lemma and a new volumetric colorful Tverberg theorem. We prove all of our results for diameter as well as volume.