Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.

Saved in:

Bibliographic Details
Title:	Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.
Authors:	Karasev, Roman r_n_karasev@mail.ru, Kynčl, Jan kyncl@kam.mff.cuni.cz, Paták, Pavel¹ patak@kam.mff.cuni.cz, Patáková, Zuzana² zuzka@kam.mff.cuni.cz, Tancer, Martin tancer@kam.mff.cuni.cz
Source:	Discrete & Computational Geometry. Oct2015, Vol. 54 Issue 3, p610-636. 27p.
Subjects:	Selection theorems, Combinatorial set theory, Topological spaces, Mathematics theorems, Computational geometry
Abstract:	We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant $$c_d > 0$$ such that whenever $$X_1, \ldots , X_{d+1}$$ are n-element subsets of $$\mathbb {R}^d$$ , we can find a point $${\mathbf {p}}\in \mathbb {R}^d$$ and subsets $$Y_i \subseteq X_i$$ for every $$i \in [d+1]$$ , each of size at least $$c_d n$$ , such that $${\mathbf {p}}$$ belongs to all rainbow d-simplices determined by $$Y_1, \ldots , Y_{d+1}$$ , i.e., simplices with one vertex in each $$Y_i$$ . We show a super-exponentially decreasing upper bound $$c_d\le e^{-(1/2-o(1))(d \ln d)}$$ . The ideas used in the proof of the upper bound also help us to prove Pach's theorem with $$c_d \ge 2^{-2^{d^2 + O(d)}}$$ , which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach's original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach's theorem with $$c_d \ge 2^{-O(d^2\log d)}$$ . In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the 'separation' part of the argument by showing that in one of the key steps only $$d+1$$ separations are necessary, compared to $$2^d$$ separations in the original proof. We also provide a measure version of Pach's theorem. [ABSTRACT FROM AUTHOR]
	Copyright of Discrete & Computational Geometry is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant $$c_d > 0$$ such that whenever $$X_1, \ldots , X_{d+1}$$ are n-element subsets of $$\mathbb {R}^d$$ , we can find a point $${\mathbf {p}}\in \mathbb {R}^d$$ and subsets $$Y_i \subseteq X_i$$ for every $$i \in [d+1]$$ , each of size at least $$c_d n$$ , such that $${\mathbf {p}}$$ belongs to all rainbow d-simplices determined by $$Y_1, \ldots , Y_{d+1}$$ , i.e., simplices with one vertex in each $$Y_i$$ . We show a super-exponentially decreasing upper bound $$c_d\le e^{-(1/2-o(1))(d \ln d)}$$ . The ideas used in the proof of the upper bound also help us to prove Pach's theorem with $$c_d \ge 2^{-2^{d^2 + O(d)}}$$ , which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach's original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach's theorem with $$c_d \ge 2^{-O(d^2\log d)}$$ . In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the 'separation' part of the argument by showing that in one of the key steps only $$d+1$$ separations are necessary, compared to $$2^d$$ separations in the original proof. We also provide a measure version of Pach's theorem. [ABSTRACT FROM AUTHOR]
ISSN:	01795376
DOI:	10.1007/s00454-015-9720-z