Enumeration of type D permutations with alternating runs
From MaRDI portal
Publication:722498
DOI10.1007/S00025-018-0840-7zbMATH Open1398.05006OpenAlexW2804104644WikidataQ129814771 ScholiaQ129814771MaRDI QIDQ722498FDOQ722498
Authors: Emily X. L. Gao, Brian Y. Sun 
Publication date: 23 July 2018
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00025-018-0840-7
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Eulerian polynomials of type \(D\).
- New Eulerian numbers of type \(D\)
- Recurrences for Eulerian polynomials of type B and type D
- \(q\)-Eulerian polynomials and polynomials with only real zeros
- Labeled ballot paths and the Springer numbers
- Enumeration of permutations by number of alternating runs
- An explicit formula for the number of permutations with a given number of alternating runs
- The peak algebra and the descent algebras of types B and D
- Counting permutations by their alternating runs
- Counting involutory, unimodal, and alternating signed permutations
- Counting signed permutations by their alternating runs
- The generating function for the Dirichlet series \(L_m(s)\)
Cited In (6)
- 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
- Ascending runs in permutations and valued Dyck paths
Uses Software
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)
