The Descent Statistic on 123-avoiding Permutations
نویسندگان
چکیده
We exploit Krattenthaler’s bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set Sn(123) of 123-avoiding permutations in Sn. In particular, we show that the descents of a permutation correspond to valleys and triple ascents of the associated Dyck path. We get the Eulerian numbers of Sn(123) by studying the joint distribution of these two statistics on Dyck paths.
منابع مشابه
Efficient generating algorithm for permutations with a fixed number of excedances
In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...
متن کاملThe pure descent statistic on permutations
We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerate...
متن کاملThe Cycle Descent Statistic on Permutations
In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملEquidistribution and Sign-Balance on 321-Avoiding Permutations
Let Tn be the set of 321-avoiding permutations of order n. Two properties of Tn are proved: (1) The last descent and last index minus one statistics are equidistributed over Tn, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2n and T2n+1 are essentially equal to ...
متن کامل