Statistics on permutations with bounded drop size

2021/01/15 by Chen, Joanna Na, Zhou, Robin Dapao
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2101.06026

Abstract

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 introduced the statistic \DIS, which turns out to satisfy that \sor(σ)=\DIS(σ^-1) for any permutation σ. In this paper, we maintain Petersen's method to deduce the generating functions of (\inv, \lmax) and (\DIS, \cyc) over bounded permutations to show their equidistribution. Moreover, the generating function of \des over 213-avoiding bounded permutations and some related equidistributions are given as well.

Related

• Combinatorial Statistics on Pattern-avoiding Permutations
• Cycles and sorting index for matchings and restricted permutations
• The Sorting Index and Permutation Codes
• Width-k Generalizations of Classical Permutation Statistics
• Descent polynomials for permutations with bounded drop size