Counting signed permutations by their alternating runs
From MaRDI portal
Publication:2439126
DOI10.1016/j.disc.2014.01.015zbMath1283.05014OpenAlexW2064896529MaRDI QIDQ2439126
Publication date: 7 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.015
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Symmetric groups (20B30)
Related Items (8)
The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials ⋮ Context-free grammars for several polynomials associated with Eulerian polynomials ⋮ Unnamed Item ⋮ Subalgebras of Solomon's descent algebra based on alternating runs ⋮ Enumeration of type \(D\) permutations with alternating runs ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ David-Barton type identities and alternating run polynomials ⋮ Eulerian pairs and Eulerian recurrence systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of permutations by number of alternating runs
- Alternating permutations and the \(m\)th descents
- The algebraic combinatorics of snakes
- An explicit formula for the number of permutations with a given number of alternating runs
- Derivative polynomials and enumeration of permutations by number of interior and left peaks
- Longest alternating subsequences of permutations
- Value-peaks of permutations
- \(q\)-Eulerian polynomials and polynomials with only real zeros
- Affine descents and the Steinberg torus
- A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs
- Hadamard products of stable polynomials are stable
- Counting permutations by their alternating runs
- The peak algebra and the descent algebras of types B and D
- Permutations with given peak set
This page was built for publication: Counting signed permutations by their alternating runs
