Enumeration of type D permutations with alternating runs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- An explicit formula for the number of permutations with a given number of alternating runs
- Counting involutory, unimodal, and alternating signed permutations
- Counting permutations by their alternating runs
- Counting signed permutations by their alternating runs
- Enumeration of permutations by number of alternating runs
- Labeled ballot paths and the Springer numbers
- New Eulerian numbers of type \(D\)
- On the Eulerian polynomials of type \(D\).
- Recurrences for Eulerian polynomials of type B and type D
- The generating function for the Dirichlet series \(L_m(s)\)
- The peak algebra and the descent algebras of types B and D
- q-Eulerian polynomials and polynomials with only real zeros
Cited in
(6)- Ascending runs in permutations and valued Dyck paths
- On the Eulerian polynomials of type \(D\).
- Generating functions of permutations with respect to their alternating runs
- Enumerating permutations by their run structure
- Counting signed permutations by their alternating runs
- On the alternating runs polynomial in type B and type D Coxeter groups
This page was built for publication: Enumeration of type \(D\) permutations with alternating runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722498)