Plane recursive trees, Stirling permutations and an urn model

  • Janson S
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free