Lower bounds on geometric Ramsey functions
Marek Eli\'a\v{s}, Ji\v{r}\'i Matou\v{s}ek, Edgardo Rold\'an-Pensado,, Zuzana Safernov\'a

TL;DR
This paper advances the understanding of geometric Ramsey functions by constructing lower bounds with tower functions and establishing a new geometric Ramsey-type theorem related to order-type homogeneity in point sequences.
Contribution
It reduces the dimension in existing constructions of semialgebraic predicates with large Ramsey functions and proves a new geometric Ramsey theorem with tight bounds.
Findings
Constructed semialgebraic predicates with tower function lower bounds in reduced dimensions.
Established a geometric Ramsey theorem for order-type homogeneous sequences.
Matched the lower bounds with known upper bounds, confirming their tightness.
Abstract
We continue a sequence of recent works studying Ramsey functions for semialgebraic predicates in . A -ary semialgebraic predicate on is a Boolean combination of polynomial equations and inequalities in the coordinates of points . A sequence of points in is called -homogeneous if either holds for all choices , or it holds for no such choice. The Ramsey function is the smallest such that every point sequence of length contains a -homogeneous subsequence of length . Conlon, Fox, Pach, Sudakov, and Suk constructed the first examples of semialgebraic predicates with the Ramsey function bounded from below by a tower function of arbitrary height: for every ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Computational Geometry and Mesh Generation · Digital Image Processing Techniques
