Related papers: Schreier Sets in Ramsey Theory

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We examine a version of Ramsey's theorem based on Tao, Gaspar and Kohlenbach's "finitary" infinite pigeonhole principle.We will show that the "finitary" infinite Ramsey's theorem naturally gives rise to statements at the level of the…

We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…

This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We introduce natural strengthenings of sequential compactness called the $r$-Ramsey property for each natural number $r\geq 1$. We prove that metrizable compact spaces are $r$-Ramsey for all $r$ and give examples of compact spaces that are…

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…

Let $\mathbf{k}$ denote the totally ordered set (or chain) on $k$ elements. The product $\mathbf{k}^t=\mathbf{k}\times\cdots\times\mathbf{k}$ is a poset called a grid. This paper discusses several loosely related results on the Ramsey…

In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…

In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…

We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…

Given a structure $M$ we introduce infinitary logic expansions, which generalise the Morleyisation. We show that these expansions are tame, in the sense that they preserve and reflect both the Embedding Ramsey Property (ERP) and the…

A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…

Extending Furstenberg's ergodic theoretic proof for Szemer\'edi's theorem on arithmetic progressions, Furstenberg and Weiss (2003) proved the following qualitative result. For every d and k, there exists an integer N such that no matter how…

Recently, Solecki introduced the notion of Ramsey monoid to produce a common generalization to theorems such as Hindman's theorem, Carlson's theorem, and Gowers' FIN$_k$ theorem. He proved that an entire class of finite monoids is Ramsey.…

We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of…