Discrepancy theory, Tverberg's theorem, and regression depth

Source abstract

We prove new bounds for Tverberg's theorem with tolerance. We show that $N = rt+Θ_{d,r}(t^{1/2-1/(2d)})$, where $N$ is the smallest number such that any set of $N$ points in $\mathbb{R}^d$ has a partition into $r$ parts such that the convex hulls of the parts intersect even if we remove any $t$ of the points. We extend Tverberg's theorem with tolerance to families of hyperplanes in $\mathbb{R}^d$, and show that for any set of $rt + O_{d,r}(t^{1/2-1/(2d)}\sqrt{\log (t+1)})$ hyperplanes in $\mathbb{R}^d$ there exists a partition of them into $r$ parts such that the regression hulls of the parts intersect even if any $t$ hyperplanes are removed. Our bounds follow from establishing a connection between Tverberg-type results and discrepancy theory.