Plane recursive trees, Stirling permutations and an urn model

By Svante Janson. 2008

49 citations recorded by the source corpus.

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

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/dcd7710522602a562eb83d8f28f1d550832b5cb5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. David Callan

In Discrete Mathematics and Combinatorics

  1. David Callan

In Mathematical Physics

  1. David Callan

Citations in the corpus