English
Related papers

Related papers: Structured sunflowers and canonical Ramsey propert…

200 papers

Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…

Geometric Topology · Mathematics 2018-12-19 Priyam Patel , Nicholas G. Vlamis

In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^\omega$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^\omega$, viewed as a topological space, has finite big Ramsey…

Logic · Mathematics 2026-02-24 Dragan Mašulović

A finite set $X$ in a Euclidean space $\mathbb{R}^d$ is called Ramsey if for every $k$ there exists an integer $n$ such that whenever $\mathbb{R}^n$ is coloured with $k$ colours, there is a monochromatic copy of $X$. Graham conjectured that…

Combinatorics · Mathematics 2025-12-05 Natalie Behague

Ramsey's theorem for $n$-tuples and $k$-colors ($\mathsf{RT}^n_k$) asserts that every k-coloring of $[\mathbb{N}]^n$ admits an infinite monochromatic subset. We study the proof-theoretic strength of Ramsey's theorem for pairs and two…

Logic · Mathematics 2018-03-20 Ludovic Patey , Keita Yokoyama

For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $\sigma$ such that every set of $t-1$ consecutive elements in $\sigma$ is contained in a $t$-element circuit…

Combinatorics · Mathematics 2021-08-27 Nick Brettell , Deborah Chun , Tara Fife , Charles Semple

We extend the hierarchy of finite-dimensional Ellentuck spaces to infinite dimensions. Using uniform barriers $B$ on $\omega$ as the prototype structures, we construct a class of continuum many topological Ramsey spaces $\mathcal{E}_B$…

Logic · Mathematics 2015-09-22 Natasha Dobrinen

This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…

Logic · Mathematics 2020-09-10 Natasha Dobrinen

Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…

Group Theory · Mathematics 2014-07-01 A. L. Agore , G. Militaru

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

Logic · Mathematics 2026-05-12 Ahmed Mimouni , Ludovic Patey

We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…

Group Theory · Mathematics 2019-08-26 Itay Kaplan , Pierre Simon

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure…

Logic in Computer Science · Computer Science 2015-07-01 Philipp Weis , Neil Immerman

Our aim in this paper is to show that, for any $k$, there is a finite colouring of the set of rationals whose denominators contain only the first $k$ primes such that no infinite set has all of its finite sums and products monochromatic. We…

Combinatorics · Mathematics 2023-03-08 Neil Hindman , Maria-Romina Ivan , Imre Leader

Generalizing and simplifying recent work of Dobrinen, we show that if $\mathcal{L}$ is a finite binary relational language and $\mathcal{F}$ is a finite set of finite irreducible $\mathcal{L}$-structures, then the class $\mathcal{K} =…

Logic · Mathematics 2022-07-12 Andy Zucker

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

We study Dirichlet forms and Laplacians on self-similar sets with overlaps. A notion of "finitely ramified of finite type($f.r.f.t.$) nested structure" for self-similar sets is introduced. It allows us to reconstruct a class of self-similar…

Functional Analysis · Mathematics 2018-06-26 Shiping Cao , Hua Qiu

We solve a long standing open problem concerning the structure of finite cycles in the category mod A of finitely generated modules over an arbitrary artin algebra A, that is, the chains of homomorphisms $M_0 \stackrel{f_1}{\rightarrow} M_1…

Representation Theory · Mathematics 2015-04-02 Piotr Malicki , José Antonio de la Peña , Andrzej Skowroński

We say a set of points $C\subset \mathbb{R}^n$ is canonically Ramsey if there is some set of points $S\subset \mathbb{R}^{n'}$ such that any colouring of $S$, with any number of colours, admits either a monochromatic or rainbow copy of $C$…

Combinatorics · Mathematics 2026-03-30 Benedict Randall Shaw

We prove a sharp structural result concerning finite colorings of pairs in well-founded trees.

Combinatorics · Mathematics 2019-05-17 R. M. Causey , C. Doebele

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

Commutative Algebra · Mathematics 2018-05-15 Yushuang Fan , Alfred Geroldinger , Florian Kainrath , Salvatore Tringali

We have observations concerning the set theoretic strength of the following combinatorial statements without the axiom of choice. 1. If in a partially ordered set, all chains are finite and all antichains are countable, then the set is…

Logic · Mathematics 2022-06-28 Amitayu Banerjee , Zalán Gyenis