Generating functions for permutations which contain a given descent set
Summary: A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation \(\sigma, des(\sigma )\), arise in this way. For any given finite set \(S\) of positive integers, we develop a method to produce similar generating functions for the set of permutations of the symmetric group Sn whose descent set contains \(S\). Our method will be to apply certain homomorphisms to symmetric function identities involving ribbon Schur functions.
- 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
- Generating functions for alternating descents and alternating major index
- Generating functions of permutations with respect to their alternating runs
- Some array polynomials over special monoid presentations
- Decreases and descents in words
- Generating functions for descents over permutations which avoid sets of consecutive patterns
- Permutations with \(k\)-regular descent patterns
- A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern
- scientific article; zbMATH DE number 140099 (Why is no real title available?)
- The density method and permutations with a prescribed descent set
- Descent sets of cyclic permutations
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)
