Equidistribution and sign-balance on 321-avoiding permutations

Research output: Contribution to journalArticlepeer-review


Abstract. 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 the last-descent enumerator for Tn. The proofs use a recursion formula for an appropriate multivariate generating function.
Original languageAmerican English
Pages (from-to)14-14
JournalSeminaire Lotharingien de Combinatoire
StatePublished - 2004

Bibliographical note

#Art. B51d


Dive into the research topics of 'Equidistribution and sign-balance on 321-avoiding permutations'. Together they form a unique fingerprint.

Cite this