English
Related papers

Related papers: A Dual Ramsey Theorem for Permutations

200 papers

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

Logic in Computer Science · Computer Science 2014-01-14 Stefano Berardi

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces are a convenient language for describing structures equipped with a family of equivalence relations. When $\Lambda$ is finite and distributive, there exists a generic…

Logic · Mathematics 2025-11-21 Samuel Braunfeld

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.

Combinatorics · Mathematics 2016-09-06 Saharon Shelah

We apply the Dual Ramsey Theorem of Graham and Rothschild to prove the Ramsey property for classes of finite Boolean algebras with distinguished ideals. This allows us to compute the universal minimal flow of the group of automorphisms of…

Dynamical Systems · Mathematics 2013-01-17 Dana Bartošová

We investigate the notion of a semi-retraction between two first order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We…

Logic · Mathematics 2024-03-05 Dana Bartošová , Lynn Scow

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 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

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 positive integers $k < n$ such that $k$ divides $n$, let $(n)^k_{\hom}$ be the set of homogeneous $k$-partitions of $\{1, \dots, n\}$, that is, the set of partitions of $\{1, \dots, n\}$ into $k$ classes of the same cardinality. In the…

Combinatorics · Mathematics 2019-07-16 Jose G. Mijares

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é

We give an abstract approach to finite Ramsey theory and prove a general Ramsey-type theorem. We deduce from it a self-dual Ramsey theorem, which is a new result naturally generalizing both the classical Ramsey theorem and the dual Ramsey…

Combinatorics · Mathematics 2013-09-12 Slawomir Solecki

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

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Combinatorics · Mathematics 2016-08-19 Andrii Arman , Vojtěch Rödl

We identify computability-theoretic properties enabling us to separate various statements about partial orders in reverse mathematics. We obtain simpler proofs of existing separations, and deduce new compound ones. This work is part of a…

Logic · Mathematics 2016-12-14 Ludovic Patey

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

In this note we study and obtain factorization theorems for colorings of matrices and Grassmannians over $\mathbb{R}$ and ${\mathbb{C}}$, which can be considered metric versions of the Dual Ramsey Theorem for Boolean matrices and of the…

Combinatorics · Mathematics 2019-10-02 Dana Bartošová , Jordi Lopez-Abad , Martino Lupini , Brice Mbombo

We prove that every finite dimensional representation of a finite group over a field of characteristic p admits a finite resolution by p-permutation modules. The proof involves a reformulation in terms of derived categories.

Representation Theory · Mathematics 2024-09-10 Paul Balmer , Martin Gallauer

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

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 2009, J. Wood proved that Frobenius bimodules have the extension property for symmetrized weight compositions. More generally, it was later shown that having a cyclic socle is sufficient for satisfying the property, while the necessity…

Rings and Algebras · Mathematics 2020-10-19 Ali Assem Mahmoud