Related papers: Ramsey transfer to semi-retractions
Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
A construction described by the current author (2017) uses two linear prototypes to build a compound graph with Ramsey properties inherited from the prototype graphs. The resulting graph is linear; and cyclic if both prototypes are cyclic.…
We consider a Ramsey statement for pairs of maps between trees, where one is an embedding as defined by Deuber and the other is a rigid surjection as defined by Solecki. We show that there is no Ramsey Theorem for pairs of maps where the…
In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…
We introduce a weak order ideal property that suffices for establishing the Evans-Griffith Syzygy Theorem. We study this weak order ideal property in settings that allow for comparison between homological algebra over a local ring $R$…
Selective ultrafilters are characterized by many equivalent properties, in particular the Ramsey property that every finite colouring of unordered pairs of integers has a homogeneous set in U, and the equivalent property that every function…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
Ramsey's Theorem states that a graph $G$ has bounded order if and only if $G$ contains no complete graph $K_n$ or empty graph $E_n$ as its induced subgraph. The Gy\'arf\'as-Sumner conjecture says that a graph $G$ has bounded chromatic…
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…
We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…
An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey Theorem on uncountable cardinals asserting…
We give an infinitary extension of the Ne\v{s}et\v{r}il-R\"{o}dl theorem for category of relational structures with special type-respecting embeddings.
As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…
A graph $G$ is semilinear of complexity $t$ if the vertices of $G$ are elements of $\mathbb{R}^{d}$ for some $d\in\mathbb{Z}^{+}$, and the edges of $G$ are defined by the sign patterns of $t$ linear functions…
Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…
Often regarded as the study of how order emerges from randomness, Ramsey theory has played an important role in mathematics and computer science, giving rise to applications in numerous domains such as logic, parallel processing, and number…
Invertibility is important in ring theory because it enables division and facilitates solving equations. Moreover, (nonassociative) rings can be endowed with an extra ''structure'' such as order and topology allowing more richness in the…
We develop the theory of Fra\"iss\'e limits for classes of finite-dimensional multi-seminormed spaces, which are defined to be vector spaces equipped with a finite sequence of seminorms. We define a notion of a Fra\"iss\'e Fr\'echet space…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…