Patterns in random permutations avoiding the pattern 321
classification
🧮 math.PR
math.CO
keywords
avoidinglengthlimitnumberpatternpermutationsrandomsigma
read the original abstract
We consider a random permutation drawn from the set of 321-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the length of $\sigma$ and $\ell$ is the number of blocks in it. The limit is not normal, and can be expressed as a functional of a Brownian excursion.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.