Abstract: Random separable permutations form a rich class of pattern-avoiding permutations, that was proved by Bassino, Bouvel, Féray, Gerin and Pierrot to converge (in the permuton sense) to a limit which can be described in terms of a Brownian excursion. We will outline their approach and present some new progress from an ongoing work with Jacopo Borga (Stanford University) and Ewain Gwynne (University of Chicago) towards understanding the length of the longest increasing subsequence in random separable permutations.
Longest increasing subsequences in uniform separable permutations
12.01.2023 13:30 - 16:30
Organiser:
M. Lis (TU Wien)
Location: