Plane recursive trees, Stirling permutations and an urn model

Simple item page
dc.creatorJanson, Svante
dc.date2008-03-07
dc.date.accessioned2026-07-07T09:25:40Z
dc.date.available2026-07-07T09:25:40Z
dc.descriptionWe 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 Polya urn
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0803.1129
dc.identifierhttp://arxiv.org/abs/0803.1129
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156483
dc.subjectCombinatorics
dc.subjectProbability
dc.titlePlane recursive trees, Stirling permutations and an urn model
dc.typetext

Files

Collections

arXiv