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 ", Duke Mathematical Journal 163.12 (2014): 2243-2270] from the semialgebraic case to arbitrary polynomially bounded -minimal expansions of , and show that it doesn't hold in . This provides a new combinatorial characterization of polynomial boundedness for -minimal structures. We also prove an analog for relations definable in -minimal structures, in particular for the field of the -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 -ary definable relations is given by the exponential tower of height .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.