Patterns in random permutations avoiding the pattern 321
arXiv:1709.08427
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 $Ï$ has a limit distribution, after scaling by $n^{m+\ell}$ where $m$ is the length of $Ï$ 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.
23 pages. Typo corrected in v2