Related papers: An Infinite self dual Ramsey theorem

Using the natural notion of {\em Hasse--Schmidt derivations on an exterior algebra}, we relate two classical and seemingly unrelated subjects. The first is the celebrated Cayley--Hamilton theorem of linear algebra, "{\em each endomorphism…

We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…

We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.

We prove that for any choice of parameters $k,t,\lambda$ the class of all finite ordered designs with parameters $k,t,\lambda$ is a Ramsey class.

First, we prove a theorem on dynamics of actions of monoids by endomorphisms of semigroups. Second, we introduce algebraic structures suitable for formalizing infinitary Ramsey statements and prove a theorem that such statements are implied…

The celebrated canonical Ramsey theorem of Erd\H{o}s and Rado implies that for $2\leq k\in \mathbb{N}$, any colouring of the edges of $K_n$ with $n$ sufficiently large gives a copy of $C_{2k}$ which has one of three canonical colour…

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…

In this paper we provide purely categorical proofs of two important results of structural Ramsey theory: the result of M.\ Soki\'c that the free product of Ramsey classes is a Ramsey class and the result of M.\ Bodirsky, M.\Pinsker and T.\…

We prove that under a principle of Ramsey regularity there are no infinite maximal almost disjoint families with respect to the transfinitely iterated Fr\'echet ideals. The results of the present paper were announced by the authors in the…

We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…

We consider the restriction of Ramsey's theorem that arises from considering only translation-invariant colourings of pairs, and show that this has the same strength (both from the viewpoint of Reverse Mathematics and from the viewpoint of…

We construct of the main object of the Partite Lemma as the colimit over a certain diagram. This gives a purely category theoretic take on the Partite Lemma and establishes the canonicity of the object. Additionally, the categorical point…

In this paper we describe the Fra\"iss\'e limit of finite MV-algebras and then prove that finite MV-algebras verify the Ramsey property. Then we show that MV-algebras are just a special case of a more general situation. In fact, under…

We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

Given a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the big Ramsey degree of $\mathcal A$ in $\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings…

The rainbow Ramsey theorem states that every coloring of tuples where each color is used a bounded number of times has an infinite subdomain on which no color appears twice. The restriction of the statement to colorings over pairs (RRT22)…

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…

The discovery of the infinite integer leads to a partition between finite and infinite numbers. Construction of an infinitesimal and infinitary number system, the Gossamer numbers. Du Bois-Reymond's much-greater-than relations and…

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…