English
Related papers

Related papers: Wilf-collapse in permutation classes having two ba…

200 papers

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

Number Theory · Mathematics 2016-09-27 Simone Ugolini

The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutation of order $k$ have a particularly simple structure.…

Combinatorics · Mathematics 2024-11-15 Frederik Garbe , Jan Hladký , Gábor Kun , Kristýna Pekárková

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

Representation Theory · Mathematics 2014-03-21 Armin Shalile

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

Rings and Algebras · Mathematics 2014-06-10 Jean-Luc Marichal , Bruno Teheux

The folding characteristics of sequences reduced with a possibly simplified representation of five types of residues are shown to be similar to their original ones with the natural set of residues (20 types or 20 letters). The reduced…

Biological Physics · Physics 2009-11-06 Jun Wang , Wei Wang

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

Combinatorics · Mathematics 2015-12-02 Gregory Berkolaiko , John Irving

This paper is one of a series whose goal is to enumerate the avoiders, in the sense of classical pattern avoidance, for each triple of 4-letter patterns. There are 317 symmetry classes of triples of 4-letter patterns, avoiders of 267 of…

Combinatorics · Mathematics 2017-08-03 David Callan , Toufik Mansour

In one-component abelian sandpile models, the toppling probabilities are independent quantities. This is not the case in multi-component models. The condition of associativity of the underlying abelian algebras impose nonlinear relations…

Statistical Mechanics · Physics 2009-04-25 F. C. Alcaraz , P. Pyatov , V. Rittenberg

A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…

Combinatorics · Mathematics 2010-05-04 Sho Matsumoto , Jonathan Novak

An overpartition is a partition such that the first occurrence (equivalently, the last occurrence) of a number may be overlined. In this article, we investigate three contents of overpartitions. We first consider the $r$-chain minimal and…

Combinatorics · Mathematics 2026-01-29 Y. H. Chen , Y. Q. Chen , Thomas Y. He , H. X. Huang , X. Zhang

In the present paper we study some algebraic properties of evolution algebras. Moreover, we reduce the study of evolution algebras of permutations to two special types of evolution algebras, idempotents and absolute nilpotent elements of…

Rings and Algebras · Mathematics 2013-07-04 Abror Kh. Khudoyberdiyev , Bakhrom A. Omirov , Izzat Qaralleh

A concrete computation -- twelve slidings with sixteen tiles -- reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of Eckmann-Hilton argument, but it does not use units. The result…

Category Theory · Mathematics 2010-03-09 Joachim Kock

The paper contains three main results. First, we show that if a commutative semigroup variety is a modular element of the lattice Com of all commutative semigroup varieties then it is either the variety COM of all commutative semigroups or…

Group Theory · Mathematics 2010-09-13 V. Yu. Shaprynskii

We construct a 3-3-1 model for three families that can be embedded into a single SU(8) unified model. Assuming appropriate branching rules and symmetry-breaking pattern, we find a complete fermion content within irreducible representations…

High Energy Physics - Phenomenology · Physics 2011-05-25 R. Martinez , F. Ochoa , P. Fonseca

We first obtain the most general and compact parametrization of the unitary transformation diagonalizing any 3 by 3 hermitian matrix H, as a function of its elements and eigenvalues. We then study a special class of fermion mass matrices,…

High Energy Physics - Phenomenology · Physics 2010-04-06 Gilles Couture , Cherif Hamzaoui , Steven S. Y. Lu , Manuel Toharia

We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…

Combinatorics · Mathematics 2024-02-26 Kassie Archer , Robert P. Laudone

Let $\mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with…

Information Theory · Computer Science 2019-07-09 Xiaogang Liu

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

Combinatorics · Mathematics 2007-05-23 Anders Claesson , Toufik Mansour