 |
Discrete Mathematics & Theoretical Computer Science |
Svante Janson - Plane recursive trees, Stirling permutations and an urn model
dmtcs:3590 - Discrete Mathematics & Theoretical Computer Science, January 1, 2008, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science - https://doi.org/10.46298/dmtcs.3590Plane recursive trees, Stirling permutations and an urn modelArticle
- 1 Department of Mathematics [Uppsala]
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.
Source: HAL:hal-01194667v1
Volume: DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
Section: Proceedings
Published on: January 1, 2008
Imported on: May 10, 2017
Keywords: Plane recursive trees,Stirling permutations,number of ascents,number of descents,urn model,generalized Pólya urn,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
10 Documents citing this article
Consultation statistics
This page has been seen 230 times.
This article's PDF has been downloaded 245 times.