Enumeration of a dual set of Stirling permutations by their alternating runs
classification
🧮 math.CO
keywords
alternatingdualpermutationsrunsstirlingconvolutioncountenumeration
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.