Generating functions of permutations with respect to their alternating runs
From MaRDI portal
Publication:2145990
Recommendations
- Enumeration of permutations by number of alternating runs
- Counting permutations by their alternating runs
- Generating functions for permutations avoiding a consecutive pattern
- Generating functions for the number of permutations with limited displacement
- Enumeration of type D permutations with alternating runs
- Generating functions for permutations which contain a given descent set
- On the generating function for consecutively weighted permutations
- Generating functions for permutation representations.
- An explicit formula for the number of permutations with a given number of alternating runs
- Generating functions for descents over permutations which avoid sets of consecutive patterns
Cites work
Cited in
(7)- Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2
- On the alternating runs polynomial in type B and type D Coxeter groups
- scientific article; zbMATH DE number 4033761 (Why is no real title available?)
- Reciprocals of exponential polynomials and permutation enumeration
- scientific article; zbMATH DE number 6683606 (Why is no real title available?)
- Simple permutations and algebraic generating functions
- A grammatical calculus for peaks and runs of permutations
This page was built for publication: Generating functions of permutations with respect to their alternating runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145990)