Generating functions for permutations which contain a given descent set
zbMATH Open1193.05016MaRDI QIDQ2380459FDOQ2380459
Authors: Manda Riehl, Jeffrey 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.)
Recommendations
- Permutations with \(k\)-regular descent patterns
- Symmetric functions and generating functions for descents and major indices in compositions
- Descents, inversions, and major indices in permutation groups
- Counting permutations with given cycle structure and descent set
- Generating functions for descents over permutations which avoid sets of consecutive patterns
Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Combinatorics on words (68R15)
Cited In (10)
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- Permutations with \(k\)-regular descent patterns
- Descent sets of cyclic permutations
- Generating functions of permutations with respect to their alternating runs
- Title not available (Why is that?)
- Decreases and descents in words
- The density method and permutations with a prescribed descent set
- Some array polynomials over special monoid presentations
- Generating functions for alternating descents and alternating major index
This page was built for publication: Generating functions for permutations which contain a given descent set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380459)