Related papers: A parametrization of the abstract Ramsey theorem
We show that the infinite-dimensional versions of Gowers' $\mathrm{FIN}_k$ and $\mathrm{FIN}_{\pm k}$ theorems can be parametrized by an infinite sequence of perfect subsets of $2^\omega$. To do so, we use ultra-Ramsey theory to obtain…
We give a parametrization with perfect sets of the abstract Ellentuck theorem. The main tool for achieving this goal is a sort of parametrization of an abstract version of the Nash-Williams theorem. As corollaries, we obtain some known…
We give an abstract approach to finite Ramsey theory and prove a general Ramsey-type theorem. We deduce from it a self-dual Ramsey theorem, which is a new result naturally generalizing both the classical Ramsey theorem and the dual Ramsey…
It is shown that the known notion of selective coideal can be extended to a family $\mathcal{H}$ of subsets of $\mathcal{R}$, where $(\mathcal{R},\leq,r)$ is a topological Ramsey space in the sense of Todorcevic (see \cite{todo}). Then it…
We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…
Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…
We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…
We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…
Given a topological Ramsey space $(\mathcal R,\leq, r)$, we extend the notion of semiselective coideal to sets $\mathcal H\subseteq\mathcal R$ and study conditions for $\mathcal H$ that will enable us to make the structure $(\mathcal…
In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…
We develop infinite-dimensional Ramsey theory for Fra\"iss\'e limits of finitely constrained free amalgamation classes in finite binary languages. We show that our approach is optimal and in particular, recovers the exact big Ramsey degrees…
This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…
We introduce the notion of (Ramsey) action of a tree on a (filtered) semigroup. We then prove in this setting a general result providing a common generalization of the infinitary Gowers Ramsey theorem for multiple tetris operations, the…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…
The structural Ramsey theory is a field on the boundary of combinatorics and model theory with deep connections to topological dynamics. Most of the known Ramsey classes in finite binary symmetric relational language can be shown to be…
One of the consequences of the Compactness Principle in structural Ramsey theory is that the small Ramsey degrees cannot exceed the corresponding big Ramsey degrees, thereby justifying the choice of adjectives. However, it is unclear what…
We apply the Dual Ramsey Theorem of Graham and Rothschild to prove the Ramsey property for classes of finite Boolean algebras with distinguished ideals. This allows us to compute the universal minimal flow of the group of automorphisms of…