Abstract
The tolerant Tverberg theorem generalizes Tverberg’s theorem by introducing a new parameter t called tolerance. It states that there is a minimal number N so that any set of at least N points in \(\mathbb R^d\) can be partitioned into r disjoint sets such that they remain intersecting even after removing any t points from X. In this paper we give an asymptotically tight bound for the tolerant Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this, we study certain partitions of order-type homogeneous sets and use a generalization of the Erdős–Szekeres theorem. As far as we know, this is the first time that a Ramsey-type theorem has been used to prove a Tverberg-type result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bárány, I., Matoušek, J., Pór, A.: Curves in \(R^d\) intersecting every hyperplane at most \(d+1\) times. In: Computational Geometry (SoCG’14), pp. 565–571. ACM, New York (2014)
Bisztriczky, T.: Characterizations of cyclic polytopes. J. Geom. 84(1–2), 30–36 (2006)
Dzunic, Z.: Largest Fence. USACO December 2008, Gold Problems. http://tjsct.wikidot.com/usaco-dec08-gold
Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)
Forge, D., Las Vergnas, M., Schuchert, P.: 10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope. Eur. J. Comb. 22(5), 705–708 (2001)
Gale, D.: Neighborly and cyclic polytopes. In: Proceedings of Symposia in Pure Mathematics, vol. 7, pp. 225–232. American Mathematical Society, Providence (1963)
García Colín, N.: Applying Tverberg type theorems to geometric problems. Ph.D. Thesis, University of London (2007)
García-Colín, N., Larman, D.: Projective equivalences of \(k\)-neighbourly polytopes. Graphs Comb. 31(5), 1403–1422 (2015)
Grünbaum, B.: Convex Polytopes. Graduate Texts in Mathematics, 2nd edn. Springer, New York (2003)
Larman, D.G.: On sets projectively equivalent to the vertices of a convex polytope. Bull. Lond. Math. Soc. 4(1), 6–12 (1972)
Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics. Springer, New York (2002)
MIT Programming Contest. Individual Round Problems 2008. http://web.mit.edu/acmicpc/www/2008/indiv/index.html
Mulzer, W., Stein, Y.: Algorithms for tolerant Tverberg partitions. Int. J. Comput. Geom. Appl. 24(4), 261–273 (2014)
Ramírez Alfonsín, J.L.: Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes. Eur. J. Comb. 22(5), 723–731 (2001)
Soberón, P.: Equal coefficients and tolerance in coloured Tverberg partitions. Combinatorica 35(2), 235–252 (2015)
Soberón, P., Strausz, R.: A generalisation of Tverberg’s theorem. Discrete Comput. Geom. 47(3), 455–460 (2012)
Suk, A.: A note on order-type homogeneous point sets. Mathematika 60(1), 37–42 (2014)
Tverberg, H.: A generalization of Radon’s theorem. J. Lond. Math. Soc. 41(1), 123–128 (1966)
Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics. Springer, Berlin (1995)
Acknowledgements
The third author was supported by CONACyT project 166306. The second author was partially supported by PAPIIT IA106316. We are thankful to the three anonymous referees for helping us improve the quality of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: János Pach
Rights and permissions
About this article
Cite this article
García-Colín, N., Raggi, M. & Roldán-Pensado, E. A Note on the Tolerant Tverberg Theorem. Discrete Comput Geom 58, 746–754 (2017). https://doi.org/10.1007/s00454-017-9875-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-017-9875-x