Tverberg partitions as weak epsilon-nets (Q2322510): Difference between revisions

The author extends the techniques he developed in \textit{P. Soberón} [Comb. Probab. Comput. 27, No. 3, 427--440 (2018; Zbl 1387.52012)] to prove the existence of an integer \(m\) such that for every sufficiently large finite set \(X \subset \mathbb{R}^d \) there a \(m\) partitions of \(X\) into \(r\) parts such that for every subset \(Y\) of \(X\) with \(\vert Y\vert \geq \epsilon \vert X\vert \) at least one of the \(m\) partitions restricted to \(Y\) is Tverberg, meaning that the convex hulls of the parts have a nonempty intersection. An exact formula for \(m\) is given, \(m\) only depends on the given \(\epsilon\) (\(0 < \epsilon \leq 1\)) and the given positive integer \(r\), but not on \(d\). It is pointed out that this theorem provides a new link between Tverberg's theorem and the weak \(\epsilon\)-net theorem. A colorful version is provided and the quest for a topological version suggested.