Generating functions for permutations which contain a given descent set

zbMATH Open1193.05016MaRDI QIDQ2380459

Manda Riehl, J. B. Remmel

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/229587

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating functionspermutation statisticsdescent setsribbon Schur functions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Combinatorics of partially ordered sets (06A07)

Related Items (4)

Generating functions of permutations with respect to their alternating runs ⋮ A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern ⋮ Some array polynomials over special monoid presentations ⋮ Descent sets of cyclic permutations

This page was built for publication: Generating functions for permutations which contain a given descent set