Abstract

We investigate bounds in Ramsey's theorem for relations definable in NIP structures. Applying model-theoretic methods to finitary combinatorics, we generalize a theorem of Bukh and Matousek [B. Bukh, J. Matoušek. "Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 11", Duke Mathematical Journal 163.12 (2014): 2243-2270] from the semialgebraic case to arbitrary polynomially bounded oo-minimal expansions of R\mathbb{R}, and show that it doesn't hold in Rexp⁡\mathbb{R}_{\exp}. This provides a new combinatorial characterization of polynomial boundedness for oo-minimal structures. We also prove an analog for relations definable in PP-minimal structures, in particular for the field of the pp-adics. Generalizing [D. Conlon, J. Fox, J. Pach, B. Sudakov, A. Suk "Ramsey-type results for semi-algebraic relations", Transactions of the American Mathematical Society 366.9 (2014): 5043-5065], we show that in distal structures the upper bound for kk-ary definable relations is given by the exponential tower of height k−1k-1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.