For permutations sampled from the Brownian separable permuton, LIS(σ_n)/n^{α(p)} converges almost surely to a positive finite random variable, and α(p) is the explicit solution of a Gamma-function equation.
The Brownian limit of separable permutations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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".
fields
math.PR 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The longest increasing subsequence of Brownian separable permutons
For permutations sampled from the Brownian separable permuton, LIS(σ_n)/n^{α(p)} converges almost surely to a positive finite random variable, and α(p) is the explicit solution of a Gamma-function equation.