On permutations with bounded drop size

From MaRDI portal



Abstract: The maximum drop size of a permutation pi of [n]=1,2,ldots,n is defined to be the maximum value of i−pi(i). Chung, Claesson, Dukes and Graham obtained polynomials Pk(x) that can be used to determine the number of permutations of [n] with d descents and maximum drop size not larger than k. Furthermore, Chung and Graham gave combinatorial interpretations of the coefficients of Qk(x)=xkPk(x) and Rn,k(x)=Qk(x)(1+x+cdots+xk)n−k, and raised the question of finding a bijective proof of the symmetry property of Rn,k(x). In this paper, we establish a bijection varphi on An,k, where An,k is the set of permutations of [n] and maximum drop size not larger than k. The map varphi remains to be a bijection between certain subsets of An,k. %related to the symmetry property. This provides an answer to the question of Chung and Graham. The second result of this paper is a proof of a conjecture of Hyatt concerning the unimodality of polynomials in connection with the number of signed permutations of [n] with d type B descents and the type B maximum drop size not greater than k.












This page was built for publication: On permutations with bounded drop size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964261)