Enumeration of a dual set of Stirling permutations by their alternating runs
Abstract
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.