ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS

DOI10.1017/S0004972716000186zbMath1361.05012arXiv1506.08716MaRDI QIDQ2986527

Haina Wang, Shi-Mei Ma

Publication date: 16 May 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08716

zbMATH Keywords

context-free grammarsEulerian polynomialsStirling permutationsalternating runs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05)

Related Items (4)

Some results related to Hurwitz stability of combinatorial polynomials ⋮ Context-free grammars, generating functions and combinatorial arrays ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ David-Barton type identities and alternating run polynomials

Cites Work

• Enumeration of permutations by number of alternating runs
• Enumeration formulæ for pattern restricted Stirling permutations
• Generalized Stirling permutations, families of increasing trees and urn models
• Context-free grammars, differential operators and formal power series
• Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences
• The blossoming of Schröder's fourth problem
• Stirling polynomials
• The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
• Counting permutations by their alternating runs
• Some combinatorial arrays generated by context-free grammars
• Commutation Relations, Normal Ordering, and Stirling Numbers
• Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
• Descent numbers and major indices for the hyperoctahedral group

This page was built for publication: ENUMERATION OF A DUAL SET OF STIRLING PERMUTATIONS BY THEIR ALTERNATING RUNS