We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also prove results on the joint distribution of the numbers of ascents, descents and plateaux in a random Stirling permutation. The proof uses an interesting generalized Pólya urn.
CITATION STYLE
Janson, S. (2008). Plane recursive trees, Stirling permutations and an urn model. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AI,...(Proceedings). https://doi.org/10.46298/dmtcs.3590
Mendeley helps you to discover research relevant for your work.