English
Related papers

Related papers: Fraisse Structures with SDAP+, Part I: Indivisibil…

200 papers

We prove that each finite chain in the two-branching countable ultrahomogeneous pseudotree has finite big Ramsey degrees. This is in contrast to the recent result of Chodounsk\'{y}, Eskew, and Weinert that antichains of size two have…

Logic · Mathematics 2026-03-10 David Chodounský , Natasha Dobrinen , Thilo Weinert

It was shown in \cite{sc12} that for a certain class of structures $\I$, $\I$-indexed indiscernible sets have the modeling property just in case the age of $\I$ is a Ramsey class. We expand this known class of structures from ordered…

Logic · Mathematics 2016-02-10 Lynn Scow

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…

Combinatorics · Mathematics 2018-07-31 Dragan Mašulović

A first-order structure $M$ is said to have the infinite sunflower property if, for each $k \in \mathbb{N}_+$ and each structure $M' \cong M$ whose elements are $k$-sets, there is $S \subseteq M'$, $S \cong M$, such that $S$ is a sunflower:…

Combinatorics · Mathematics 2026-03-10 Rob Sullivan , Jeroen Winkel

By a result of Zucker, every Fra\"iss\'e structure $\bf F$ for which the elements of $\mathrm{Age}(\bf F)$ have finite Ramsey degrees admits a Fra\"iss\'e precompact expansion $\bf F^{*}$ whose age $\mathrm{Age}(\bf F^{*})$ has the Ramsey…

Combinatorics · Mathematics 2019-03-28 Lionel Nguyen Van Thé

Big Ramsey degrees of finite structures are usually considered with respect to a Fra\"{i} ss\'e limit. Building mainly on the work of Devlin, Sauer, Laflamme and Van Th\'e, in this paper we consider structures which are not Fra\"{i} ss\'e…

Combinatorics · Mathematics 2018-07-06 Dragan Masulovic

Under no additional assumptions, in this paper we construct a Ramsey expansion for every category of finite objects with finite small Ramsey degrees. Our construction is based on the relationship between small Ramsey degrees, weak…

Logic · Mathematics 2022-08-25 Dragan Mašulović , Andy Zucker

In this paper we introduce a new topological Ramsey space whose elements are infinite ordered polyhedra. Then, we show as an application that the set of finite polyhedra satisfies two types of Ramsey property: one, when viewed as a category…

Combinatorics · Mathematics 2016-02-08 Jose G. Mijares , Gabriel Padilla

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…

Logic · Mathematics 2024-07-30 Dragan Mašulović

Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…

Logic in Computer Science · Computer Science 2023-02-14 Pascal Bergsträßer , Moses Ganardi , Anthony W. Lin , Georg Zetzsche

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…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

A general method for constructing a new class of topological Ramsey spaces is presented. Members of such spaces are infinite sequences of products of Fra\"iss\'e classes of finite relational structures satisfying the Ramsey property. The…

Logic · Mathematics 2015-10-20 Natasha Dobrinen , Jose G. Mijares , Timothy Trujillo

We introduce the notion of a {\it semi-retraction}. Given two structures $\A$ and $\B$, $\A$ is a semi-retraction of $\B$ if there exist quantifier-free type respecting maps $f: \B \raw \A$ and $g: \A \raw \B$ such that $f \circ g$ is an…

Logic · Mathematics 2020-11-03 Lynn Scow

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization,…

In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…

Formal Languages and Automata Theory · Computer Science 2018-10-18 Paul Gastin , Shankara Narayanan Krishna

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović

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…

Combinatorics · Mathematics 2017-06-07 Jan Hubička , Jaroslav Nešetřil

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…

Combinatorics · Mathematics 2019-09-04 Jan Hubička , Jaroslav Nešetřil

A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every…

Combinatorics · Mathematics 2011-12-02 James Fairbanks

A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism.…

Logic · Mathematics 2019-05-29 Claude Laflamme , Maurice Pouzet , Norbert Sauer , Robert Woodrow