Enumeration of type \(D\) permutations with alternating runs

DOI10.1007/s00025-018-0840-7zbMath1398.05006OpenAlexW2804104644MaRDI QIDQ722498

Brian Y. Sun, Emily X. L. Gao

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

zbMATH Keywords

alternating runspeaksvalleystype \(D\) permutationsup signed permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (1)

Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• New Eulerian numbers of type \(D\)
• Enumeration of permutations by number of alternating runs
• An explicit formula for the number of permutations with a given number of alternating runs
• Recurrences for Eulerian polynomials of type B and type D
• \(q\)-Eulerian polynomials and polynomials with only real zeros
• On the Eulerian polynomials of type \(D\).
• Counting signed permutations by their alternating runs
• Counting permutations by their alternating runs
• Counting involutory, unimodal, and alternating signed permutations
• Labeled Ballot Paths and the Springer Numbers
• The peak algebra and the descent algebras of types B and D
• The generating function for the Dirichlet series $L_{m}(s)$

This page was built for publication: Enumeration of type \(D\) permutations with alternating runs