pith. sign in

arxiv: 0803.1129 · v1 · submitted 2008-03-07 · 🧮 math.CO · math.PR

Plane recursive trees, Stirling permutations and an urn model

classification 🧮 math.CO math.PR
keywords resultsstirlingpermutationsplanerecursivesometreesascents
0
0 comments X
read the original 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 Polya urn

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.