Counting permutations by peaks, descents, and cycle type
From MaRDI portal
Publication:2199803
Recommendations
Cites work
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- A computational and combinatorial exposé of plethystic calculus
- Analysis of casino shelf shuffling machines
- Counting permutations with given cycle structure and descent set
- Enumerative combinatorics. Volume 2.
- Fonctions symétriques et séries hypergéométriques basiques multivariées
- The distribution of descents in fixed conjugacy classes of the symmetric groups
Cited in
(15)- Hopping from Chebyshev polynomials to permutation statistics
- Algebraic properties for some permutation statistics
- Plethystic formulas for permutation enumeration
- Eulerian polynomials and excedance statistics
- Counting permutations by runs
- Permutations with given peak set
- Counting and signed counting permutations by descent-based statistics
- Peaks are preserved under run-sorting
- Statistics on permutations
- On the joint distribution of cyclic valleys and excedances over conjugacy classes of \(\mathfrak{S}_n\)
- Counting permutations by cyclic peaks and valleys
- A context-free grammar for peaks and double descents of permutations
- \(q\)-counting descent pairs with prescribed tops and bottoms
- A combinatorial proof for the enumeration of alternating permutations with given peak set
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
This page was built for publication: Counting permutations by peaks, descents, and cycle type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199803)