Random monotone factorisations of the cycle and their lamination process
From MaRDI portal
Cites work
- A bijection on ordered trees and its consequences
- A geometric representation of fragmentation processes on stable trees
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Balanced tableaux
- Diffusion processes and their sample paths.
- Enumeration of planar constellations
- Enumerations of ordered trees
- scientific article; zbMATH DE number 6806798 (Why is no real title available?)
- scientific article; zbMATH DE number 1834045 (Why is no real title available?)
- Minimal factorizations of permutations into star transpositions
- Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
- On Riemann surfaces with given branch points.
- On the number of reduced decompositions of elements of Coxeter groups
- Partial Jucys-Murphy elements and star factorizations
- Probabilizing parking functions
- Random generation and scaling limits of fixed genus factorizations into transpositions
- Random sorting networks
- Recursive self-similarity for random trees, random triangulations and Brownian excursion
- Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ary trees
- Some factorisations counted by Catalan numbers
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- The local limit of random sorting networks
- Trajectories in random minimal transposition factorizations
- Transitive powers of Young-Jucys-Murphy elements are central.
- Tree-like properties of cycle factorizations
- Trees, parking functions and factorizations of full cycles
This page was built for publication: Random monotone factorisations of the cycle and their lamination process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6896152)