English
Related papers

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

200 papers

We call an infinite structure $\mathcal{M}$ sunflowerable if whenever $\mathcal{M}'$ is isomorphic to $\mathcal{M}$ with underlying set $M'$, consisting of finite sets of bounded size, there is an $M_0 \subseteq M'$ such that $M_0$ is a…

Combinatorics · Mathematics 2025-07-29 Nathanael Ackerman , Mary Leah Karker , Mostafa Mirabi

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

A construction described by the current author in 2017 uses two linear `prototype' graphs to build a compound graph with Ramsey properties inherited from the prototypes. This paper describes a generalisation of that construction which has…

Combinatorics · Mathematics 2021-09-13 Fred Rowley

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order…

Logic in Computer Science · Computer Science 2020-04-17 Dominik Kirst , Dominique Larchey-Wendling

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

We present a novel verification technique to prove interesting properties of a class of array programs with a symbolic parameter N denoting the size of arrays. The technique relies on constructing two slightly different versions of the same…

Programming Languages · Computer Science 2021-07-05 Supratik Chakraborty , Ashutosh Gupta , Divyesh Unadkat

Many natural notions of additive and multiplicative largeness arise from results in Ramsey theory. In this paper, we explain the relationships between these notions for subsets of $\mathbb{N}$ and in more general ring-theoretic structures.…

Combinatorics · Mathematics 2024-09-11 Vitaly Bergelson , Daniel Glasscock

This article documents my journey down the rabbit hole, chasing what I have come to know as a particularly unyielding problem in Ramsey theory on the integers: the $2$-Large Conjecture. This conjecture states that if $D \subseteq…

Combinatorics · Mathematics 2020-01-20 Aaron Robertson

The metric Ramsey problem asks for the largest subset $S$ of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version…

Data Structures and Algorithms · Computer Science 2017-07-28 Ittai Abraham , Shiri Chechik , Michael Elkin , Arnold Filtser , Ofer Neiman

This article introduces a line of investigation into connections between creature forcings and topological Ramsey spaces. Three examples of sets of pure candidates for creature forcings are shown to contain dense subsets which are actually…

Logic · Mathematics 2016-07-20 Natasha Dobrinen

A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\rho$, every graph $G$ with sufficiently large $\rho(G)$ contains a `well-structured' induced subgraph $H$ with…

Combinatorics · Mathematics 2018-08-15 Ilkyoo Choi , Michitaka Furuya , Ringi Kim , Boram Park

There is a long history of studying Ramsey theory using the algebraic structure of Stone-Cech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic large…

Dynamical Systems · Mathematics 2020-05-12 Pintu Debnath , Sayan Goswami

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

Logic · Mathematics 2015-03-10 Ove Ahlman , Vera Koponen

Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…

Discrete Mathematics · Computer Science 2013-08-02 Sudheer Vakati , David Fernández-Baca

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

Rings and Algebras · Mathematics 2026-05-12 Joakim Arnlind , Stefan Wagner

We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…

Logic · Mathematics 2025-12-22 Valeria Giustarini , Sara Ugolini

Ramsey's theorem states that for all finite colorings of an infinite set, there exists an infinite homogeneous subset. What if we seek a homogeneous subset that is also order-equivalent to the original set? Let $S$ be a linearly ordered set…

Combinatorics · Mathematics 2025-11-11 Joanna Boyland , William Gasarch , Nathan Hurtig , Robert Rust

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.

Combinatorics · Mathematics 2017-03-03 Jaroslav Nešetřil , Vojtěch Rödl

This paper gives a complete characterization of infinitely divisible semimartingales, i.e., semimartingales whose finite dimensional distributions are infinitely divisible. An explicit and essentially unique decomposition of such…

Probability · Mathematics 2014-05-02 Andreas Basse-O'Connor , Jan Rosinski

We define the dualizations of objects and concepts which are essential for investigating the Ramsey property in the first levels of the projective hierarchy, prove a forcing equivalence theorem for dual Mathias forcing and dual Laver…

Logic · Mathematics 2007-05-23 Lorenz Halbeisen , Benedikt Loewe