Discrete & Computational Geometry

, Volume 54, Issue 3, pp 610–636 | Cite as

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

  • Roman Karasev
  • Jan Kynčl
  • Pavel Paták
  • Zuzana Patáková
  • Martin Tancer


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 rainbowd-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.


Pach’s selection theorem d-Dimensional simplex Solid angle Borel probability measure Weak convergence of measures 

Mathematics Subject Classification

52C35 52C10 28A75 28A33 


  1. 1.
    Akopyan, A., Karasev, R.: Bounding minimal solid angles of polytopes. Preprint; arXiv:1505.05263v1 (2015)
  2. 2.
    Alexandroff, A.D.: Additive set-functions in abstract spaces. Mat. Sb., Nov. Ser. 13(55), 169–238 (1943)MathSciNetGoogle Scholar
  3. 3.
    Bárány, I.: A generalization of Carathéodory’s theorem. Discrete Math. 40, 141–152 (1982)MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Bárány, I., Pach, J.: Homogeneous selections from hyperplanes. J. Comb. Theory Ser. B 104, 81–87 (2014)MATHCrossRefGoogle Scholar
  5. 5.
    Bogachev, V.I.: Measure Theory, vol. II. Springer, Berlin (2007)MATHCrossRefGoogle Scholar
  6. 6.
    Boros, E., Füredi, Z.: The number of triangles covering the center of an \(n\)-set. Geom. Dedicata 17(1), 69–77 (1984)MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Fox, J., Gromov, M., Lafforgue, V., Naor, A., Pach, J.: Overlap properties of geometric expanders. J. Reine Angew. Math. 671, 49–83 (2012)MATHMathSciNetGoogle Scholar
  8. 8.
    Fox, J., Pach, J., Suk, A.: A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. Preprint; arXiv:1502.01730v1 (2015)
  9. 9.
    Gao, F., Hug, D., Schneider, R.: Intrinsic volumes and polar sets in spherical space. Math. Notae 41, 159–176 (2003)MathSciNetGoogle Scholar
  10. 10.
    Gromov, M.: Singularities, expanders and topology of maps. Part 2: From combinatorics to topology via algebraic isoperimetry. Geom. Funct. Anal. 20(2), 416–526 (2010)MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Jiang, Z.: A slight improvement to the colored Bárány’s theorem. Electron. J. Comb. 21(4), p-4–39 (2014)Google Scholar
  12. 12.
    Kallus, Y.: Which values can attain the minimum solid angle in a simplex. MathOverflow, http://mathoverflow.net/questions/136313#comment351368_136313 (2013). Comment on a question of M. Tancer
  13. 13.
    Karasev, R.: A simpler proof of the Boros–Füredi–Bárány–Pach–Gromov theorem. Discrete Comput. Geom. 47(3), 492–495 (2012)MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Král’, D., Mach, L., Sereni, J.S.: A new lower bound based on Gromov’s method of selecting heavily covered points. Discrete Comput. Geom. 48(2), 487–498 (2012)MATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Kynčl, J., Paták, P., Safernová, Z., Tancer, M.: Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Preprint; arXiv:1403.8147v2 (2014)
  16. 16.
    Matoušek, J., Wagner, U.: On Gromov’s method of selecting heavily covered points. Discrete Comput. Geom. 52(1), 1–33 (2014)MATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Matoušek, J.: Lectures on Discrete Geometry. Springer, New York (2002)MATHCrossRefGoogle Scholar
  18. 18.
    Matoušek, J.: Using the Borsuk–Ulam Theorem. Springer, Berlin (2003)MATHGoogle Scholar
  19. 19.
    O’Rourke, J.: Angle of a regular simplex. MathOverflow, http://mathoverflow.net/a/53881/24076 (2011). Answer to a question of B. Bukh
  20. 20.
    Pach, J.: A Tverberg-type result on multicolored simplices. Comput. Geom. 10, 71–76 (1998)MATHMathSciNetCrossRefGoogle Scholar
  21. 21.
    Räcke, H.: Measure Concentration for the Sphere. Lecture Notes, http://www.dcs.warwick.ac.uk/~harry/teaching/pdf/lecture13 (2006)
  22. 22.
    Rogers, C.A.: An asymptotic expansion for certain Schläfli functions. J. Lond. Math. Soc. 36, 78–80 (1961)MATHCrossRefGoogle Scholar
  23. 23.
    Tao, T.: An Epsilon of Room, I: Real Analysis. Graduate Studies in Mathematics, vol. 117. American Mathematical Society, Providence, RI (2010)Google Scholar
  24. 24.
    Zong, C.: Sphere Packings. Universitext. Springer, New York (1999)MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Moscow Institute of Physics and TechnologyInstitutskiy per. 9DolgoprudnyRussia
  2. 2.Institute for Information Transmission ProblemsRASMoscowRussia
  3. 3.Department of Applied Mathematics and Institute for Theoretical Computer ScienceCharles UniversityPrague 1Czech Republic
  4. 4.Alfréd Rényi Institute of MathematicsBudapestHungary
  5. 5.Chair of Combinatorial Geometry, École Polytechnique Fédérale de LausanneEPFL-SB-MATHGEOM-DCGLausanneSwitzerland
  6. 6.Department of AlgebraCharles UniversityPrague 8Czech Republic
  7. 7.IST AustriaKlosterneuburgAustria

Personalised recommendations