Plane recursive trees, Stirling permutations and an urn model

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.
Type de document :
Communication dans un congrès
Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.541-548, 2008, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01194667
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 7 septembre 2015 - 12:50:50
Dernière modification le : mercredi 10 mai 2017 - 17:41:21
Document(s) archivé(s) le : mardi 8 décembre 2015 - 12:53:16

Fichier

dmAI0137.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01194667, version 1

Collections

Citation

Svante Janson. Plane recursive trees, Stirling permutations and an urn model. Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.541-548, 2008, DMTCS Proceedings. 〈hal-01194667〉

Partager

Métriques

Consultations de la notice

66

Téléchargements de fichiers

38