English
Related papers

Related papers: Combinatorial Statistics on Pattern-avoiding Permu…

200 papers

We construct an intriguing bijection between $021$-avoiding inversion sequences and $(2413,4213)$-avoiding permutations, which proves a sextuple equidistribution involving double Eulerian statistics. Two interesting applications of this…

Combinatorics · Mathematics 2016-12-20 Zhicong Lin , Dongsu Kim

Laguerre histories (restricted or not) are certain weighted Motzkin paths with two types of level steps. They are, on one hand, in natural bijection with the set of permutations, and on the other hand, yield combinatorial interpretations…

Combinatorics · Mathematics 2022-08-25 Joanna N. Chen , Shishuo Fu

Permutation statistics constitute a classical subject of enumerative combinatorics. In her study of the genus zeta function, Denert discovered a new Mahonian statistic for permutations, which is called the Denert's statistic ({\bf $\den$})…

Combinatorics · Mathematics 2026-01-29 Kaimei Huang , Yongzhou Wen , Sherry H. F. Yan

Recently, Jel\'inek conjectured that there exists a bijection between certain restricted permutations and Fishburn matrices such that the bijection verifies the equidistribution of several statistics. The main objective of this paper is to…

Combinatorics · Mathematics 2018-08-14 Dandan Chen , Sherry H. F. Yan , Robin D. P. Zhou

In 1916, MacMahon showed that permutations in $S_n$ with a fixed descent set $I$ are enumerated by a polynomial $d_I(n)$. Diaz-Lopez, Harris, Insko, Omar, and Sagan recently revived interest in this descent polynomial, and suggested the…

Combinatorics · Mathematics 2020-12-01 Kaarel Hänni

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…

Combinatorics · Mathematics 2012-03-20 Vincent Vajnovszki

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

Combinatorics · Mathematics 2018-05-07 Arthur Nunge

We present a theory of particles, obeying intermediate statistics ("anyons"), interpolating between Bosons and Fermions, based on the principle of Detailed Balance. It is demonstrated that the scattering probabilities of identical particles…

Quantum Physics · Physics 2008-11-26 R. Acharya , P. Narayana Swamy

Following a result of Eriksen and Sj\"{o}strand (2014) we detail a technique to construct structures following the Fishburn distribution from appropriate Mahonian structures. This technique is introduced on a bivincular pattern of…

Combinatorics · Mathematics 2015-03-11 Stuart A. Hannah

It is well-known that the set $\mathbf I_n$ of involutions of the symmetric group $\mathbf S_n$ corresponds bijectively - by the Foata map $F$ - to the set of $n$-permutations that avoid the two vincular patterns $\underline{123},$…

Combinatorics · Mathematics 2023-06-22 M. Barnabei , F. Bonetti , N. Castronuovo , M. Silimbani

We examine the enumeration of certain Motzkin objects according to the numbers of crossings and nestings. With respect to continued fractions, we compute and express the distributions of the statistics of the numbers of crossings and…

Combinatorics · Mathematics 2021-07-20 Sandrataniaina R. Andriantsoa , Paul M. Rakotomamonjy

We prove a conjecture of Haglund which can be seen as an extension of the equidistribution of the inversion number and the major index over permutations to ordered set partitions. Haglund's conjecture implicitly defines two statistics on…

Combinatorics · Mathematics 2014-09-04 Jeffrey B. Remmel , Andrew Timothy Wilson

Permutations with bounded drop size, which we also call bounded permutations, was introduced by Chung, Claesson, Dukes and Graham. Petersen introduced a new Mahonian statistic the sorting index, which is denoted by $\sor$. Meanwhile, Wilson…

Combinatorics · Mathematics 2021-01-18 Joanna Na Chen , Robin Dapao Zhou

Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and…

Combinatorics · Mathematics 2007-05-23 Anders Claesson

We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…

Combinatorics · Mathematics 2023-06-22 Sergi Elizalde

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

Combinatorics · Mathematics 2024-09-02 Sergi Elizalde , Johnny Rivera , Yan Zhuang

Permutation statistics $\wnm$ and $\rlm$ are both arising from permutation tableaux. $\wnm$ was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While $\rlm$ is…

Combinatorics · Mathematics 2021-02-16 Joanna N. Chen

Let $A_n\subseteq S_n$ denote the alternating and the symmetric groups on $1,...,n$. MacMahaon's theorem, about the equi-distribution of the length and the major indices in $S_n$, has received far reaching refinements and generalizations,…

Combinatorics · Mathematics 2007-05-23 Amitai Regev , Yuval Roichman

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

Combinatorics · Mathematics 2023-06-22 Samuel Miner , Douglas Rizzolo , Erik Slivken

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

Combinatorics · Mathematics 2015-05-28 Michal Opler