Enumeration of permutations by number of alternating descents
From MaRDI portal
Publication:906484
DOI10.1016/J.DISC.2015.12.007zbMATH Open1329.05015OpenAlexW4207036379MaRDI QIDQ906484FDOQ906484
Authors: Shi-Mei Ma, Yeong-Nan Yeh
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
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Bernoulli and Euler numbers and polynomials (11B68)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Combinatorics of permutations
- \(q\)-Eulerian polynomials and polynomials with only real zeros
- Variations on descents and inversions in permutations
- 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
- Enriched 𝑃-Partitions
- Derivative Polynomials for Tangent and Secant
- Alternating permutations and the \(m\)th descents
- Generating functions for alternating descents and alternating major index
- Tchebyshev triangulations of stable simplicial complexes
- Some combinatorial arrays related to the Lotka-Volterra system
- A kind of Eulerian numbers connected to Whitney numbers of Dowling lattices
Cited In (18)
- Alternating permutations and the \(m\)th descents
- The asymptotics of almost alternating permutations
- Enumerating Nondegenerate Permutations
- Positivity of iterated sequences of polynomials
- Signed alternating descent enumeration in classical Weyl groups
- Positivity and divisibility of enumerators of alternating descents
- A combinatorial proof for the enumeration of alternating permutations with given peak set
- Counting simsun permutations by descents
- Dynamic space packing
- Some results related to Hurwitz stability of combinatorial polynomials
- Enumeration of snakes and cycle-alternating permutations
- Alternating Eulerian polynomials and left peak polynomials
- Enumeration of permutations by the parity of descent positions
- New proofs of interlacing of zeros of Eulerian polynomials. III
- Enumeration of bigrassmannian permutations below a permutation in Bruhat order
- Polynomials related to \(q\)-analog of the generalized derivative polynomials
- Context-free grammars, generating functions and combinatorial arrays
- Permutations with extremal number of fixed points
Uses Software
This page was built for publication: Enumeration of permutations by number of alternating descents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906484)