BEGIN:VCALENDAR
VERSION:2.0
PRODID:talks.ox.ac.uk
BEGIN:VEVENT
SUMMARY:Scaling limits of finitely specified permutation classes - Mickaë
l Maazoun (ENS Lyon)
DTSTART;VALUE=DATE-TIME:20200217T120000Z
DTEND;VALUE=DATE-TIME:20200217T130000Z
UID:https://talks.ox.ac.uk/talks/id/76cda1bb-51ad-46c2-9b2d-e34ba488e0d4/
DESCRIPTION:The subject of pattern-avoiding permutations is a classic of e
numerative combinatorics\, still rich of interesting open problems. We ado
pt a probabilistic point of view: What does the diagram of a large permuta
tion in a pattern-avoiding class typically look like? Generalising previo
us results\, we consider classes with nice encodings by multi-type trees.
We show that they converge either to "Brownian separable permutons" or det
erministic limit shapes.\n\nI will explain how we use analytic combinatori
cs to study the scaling limit of the encoding trees without completely los
ing information about types and degrees of branch points.\n\nIf I have som
e time left\, I will talk about some computations that we can perform on t
he limiting objects\, with interesting consequences in the discrete.\n\nTh
is is joint work with F. Bassino\, M. Bouvel\, V. Féray\, L. Gerin\, A. P
ierrot -- arXiv:1903.07522.\nSpeakers:\nMickaël Maazoun (ENS Lyon)
LOCATION:Mathematical Institute (L4)\, Woodstock Road OX2 6GG
URL:https://talks.ox.ac.uk/talks/id/76cda1bb-51ad-46c2-9b2d-e34ba488e0d4/
BEGIN:VALARM
ACTION:display
DESCRIPTION:Talk:Scaling limits of finitely specified permutation classes
- Mickaël Maazoun (ENS Lyon)
TRIGGER:-PT1H
END:VALARM
END:VEVENT
END:VCALENDAR