Tverberg partitions as weak epsilon-nets (Q2322510): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2805420060 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1711.11496 / rank | |||
Normal rank |
Latest revision as of 05:09, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tverberg partitions as weak epsilon-nets |
scientific article |
Statements
Tverberg partitions as weak epsilon-nets (English)
0 references
4 September 2019
0 references
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.
0 references
Tverberg partitions
0 references
weak epsilon net
0 references