Probability and Combinatorics Seminar: Random trees, laminations and factorizations.
- Date: –18:15
- Location: Zoom https://uu-se.zoom.us/j/67720169564, Password: first six digits of Pi after the decimal point. 4006
- Lecturer: Paul Thévenin
- Organiser: Matematiska institutionen
- Contact person: Clément Requilé
A minimal factorization of the n-cycle is a way of seeing the cycle (1 2 3 ... n) (sending 1 to 2, 2 to 3, ..., n to 1) as a product of (n-1) transpositions. By coding each of these transpositions by a chord in the unit disk, one sees a uniform minimal factorization as a random process of laminations, which are sets of noncrossing chords in the disk.
In this talk, I will discuss the convergence of this process, and highlight various connections between this model, a family of random trees and fragmentation processes. If time allows, I will also present some possible generalizations of these results to other models of factorizations.
Meeting id: 67720169564 - Link.
Password: first six digits of Pi after the decimal point.