2000 character limit reached
The Brownian limit of separable permutations
Published 16 Feb 2016 in math.PR and math.CO | (1602.04960v3)
Abstract: We study random uniform permutations in an important class of pattern-avoiding permutations: the separable permutations. We describe the asymptotics of the number of occurrences of any fixed given pattern in such a random permutation in terms of the Brownian excursion. In the recent terminology of permutons, our work can be interpreted as the convergence of uniform random separable permutations towards a "Brownian separable permuton".
Paper Prompts
Sign up for free to create and run prompts on this paper.