English
Related papers

Related papers: Ramsey Properties of Permutations

200 papers

Let $P_t$ denote the path on $t$ vertices. The $r$-coloured Ramsey number of $P_t$, denoted by $R_r(P_t)$, is the minimum integer $n$ such that whenever the complete graph on $n$ vertices is given an $r$-edge-colouring, there exists a…

Combinatorics · Mathematics 2021-08-17 Henry Liu , Bojan Mohar , Yongtang Shi

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Group Theory · Mathematics 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

Group Theory · Mathematics 2011-09-12 Charles F. Rocca

We show that the big Ramsey degree of the Boolean algebra with 3 atoms within the countable atomless Boolean algebra is infinite.

We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.

Combinatorics · Mathematics 2007-05-23 Micah Coleman

We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…

Commutative Algebra · Mathematics 2025-11-25 Fernando Martin-Maroto , Antonio Ricciardo , David Mendez , Gonzalo G. de Polavieja

It is well-known that any permutation can be written as a product of two involutions. We provide an explicit formula for the number of ways to do so, depending only on the cycle type of the permutation. In many cases, these numbers are sums…

Combinatorics · Mathematics 2012-02-27 T. Kyle Petersen , Bridget Eileen Tenner

We define a collection of topological Ramsey spaces consisting of equivalence relations on $\omega$ with the property that the minimal representatives of the equivalence classes alternate according to a fixed partition of $\omega$. To prove…

Logic · Mathematics 2021-12-14 Jamal K. Kawach , Stevo Todorcevic

Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under…

Logic · Mathematics 2016-06-29 Nathanael Ackerman , Cameron Freer , Rehana Patel

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 introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

Combinatorics · Mathematics 2007-05-23 Sophie Huczynska , Vincent Vatter

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

Logic · Mathematics 2016-12-16 Tobias Boege

In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation…

Combinatorics · Mathematics 2010-02-16 Jiyou Li , David B. Chandler , Qing Xiang

We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…

Combinatorics · Mathematics 2022-03-09 G. Gutierres , R. Mamede , J. L. Santos

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

In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…

Logic · Mathematics 2023-07-25 Keegan Dasilva Barbosa , Dragan Mašulović , Rajko Nenadov

In this note we explicitly give all the equivalent classes of deformations of the 5-dimensional Heisenberg Lie algebra $\mathfrak{h}_2$ over complex or real number fields. We show that there are altogether 20 infinitesimal deformations…

Quantum Algebra · Mathematics 2025-04-22 Alice Fialowski , Ashis Mandal

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…

Combinatorics · Mathematics 2025-07-02 Aleksa Džuklevski , Dragan Mašulović