Ramsey-type results for semi-algebraic relations

For natural numbers d and t there exists a positive C such that if F is a family of nC semi-algebraic sets in Rd of description complexity at most t, then there is a subset F' of F of size $n$ such that either every pair of elements in F' intersect or the elements of F' are pairwise disjoint. This result, which also holds if the intersection relation is replaced by any semi-algebraic relation of bounded description complexity, was proved by Alon, Pach, Pinchasi, Radoicic, and Sharir and improves on a bound of 4n for the family F which follows from a straightforward application of Ramsey's theorem. We extend this semi-algebraic version of Ramsey's theorem to k-ary relations and give matching upper and lower bounds for the corresponding Ramsey function, showing that it grows as a tower of height k-1. This improves on a direct application of Ramsey's theorem by one exponential. We apply this result to obtain new estimates for some geometric Ramsey-type problems relating to order types and one-sided sets of hyperplanes. We also study the off-diagonal case, achieving some partial results.

[1]  Noga Alon,et al.  Crossing patterns of semi-algebraic sets , 2005, J. Comb. Theory, Ser. A.

[2]  Joel H. Spencer,et al.  Turán's theorem for k-graphs , 1972, Discret. Math..

[3]  T. Bohman.  The triangle-free process , 2008, 0806.4375.

[4]  R. Thom.  Sur L'Homologie des Varietes Algebriques Réelles , 1965 .

[5]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[6]  János Komlós,et al.  A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[7]  A. Hajnal,et al.  Partition relations for cardinal numbers , 1965 .

[8]  B. Sudakov,et al.  Erdős–Szekeres‐type theorems for monotone paths and convex bodies , 2011, 1105.2097.

[9]  János Pach,et al.  Overlap properties of geometric expanders , 2011, SODA '11.

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Vida Dujmovic,et al.  A center transversal theorem for hyperplanes and applications to graph drawing , 2011, SoCG '11.

[12]  J. Pach,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[13]  S. S. Cairns,et al.  Differential and combinatorial topology : a symposium in honor of Marston Morse , 1965 .

[14]  Jeong Han Kim,et al.  The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[15]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[16]  D. Conlon,et al.  Hypergraph Ramsey numbers , 2008, 0808.3760.

[17]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[18]  Marek Eliáý,et al.  Higher-order Erdös: Szekeres theorems , 2012, SoCG 2012.

[19]  Ingo Schiermeyer,et al.  The Ramsey number r(C7, C7, C7) , 2003, Discuss. Math. Graph Theory.

[20]  J. Milnor.  On the Betti numbers of real varieties , 1964 .

[21]  David Conlon,et al.  An improved bound for the stepping-up lemma , 2009, Discret. Appl. Math..

[22]  Peter Keevash,et al.  The early evolution of the H-free process , 2009, 0908.0429.

[23]  P. Erdös,et al.  Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .

[24]  P. Erdös.  Some remarks on the theory of graphs , 1947 .

[25]  Boris Bukh,et al.  Erdős–Szekeres-type statements: Ramsey function and decidability in dimension $1$ , 2012, 1207.0705.

[26]  Jirí Matousek,et al.  Good splitters for counting points in triangles , 1989, SCG '89.

[27]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[28]  D. Conlon.  A new upper bound for diagonal Ramsey numbers , 2006, math/0607788.

[29]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[30]  Marek Eliáš,et al.  Higher-order Erdös: Szekeres theorems , 2011, SoCG '12.