Enumeration of permutations by number of alternating descents
From MaRDI portal
Publication:906484
DOI10.1016/j.disc.2015.12.007zbMath1329.05015OpenAlexW4207036379MaRDI QIDQ906484
Publication date: 21 January 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.007
Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05)
Related Items (8)
Positivity and divisibility of enumerators of alternating descents ⋮ Polynomials related to \(q\)-analog of the generalized derivative polynomials ⋮ Positivity of Iterated Sequences of Polynomials ⋮ Some results related to Hurwitz stability of combinatorial polynomials ⋮ Context-free grammars, generating functions and combinatorial arrays ⋮ Signed alternating descent enumeration in classical Weyl groups ⋮ Enumeration of permutations by the parity of descent positions ⋮ Alternating Eulerian polynomials and left peak polynomials
Uses Software
Cites Work
- Unnamed Item
- Alternating permutations and the \(m\)th descents
- An explicit formula for the number of permutations with a given number of alternating runs
- Counting permutations by alternating descents
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- \(q\)-Eulerian polynomials and polynomials with only real zeros
- Variations on descents and inversions in permutations
- Generating functions for alternating descents and alternating major index
- Some combinatorial arrays related to the Lotka-Volterra system
- Tchebyshev triangulations of stable simplicial complexes
- A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices
- Combinatorics of Permutations
- Derivative Polynomials for Tangent and Secant
- Enriched 𝑃-Partitions
This page was built for publication: Enumeration of permutations by number of alternating descents
