Patterns in random permutations avoiding the pattern 132
arXiv:1401.5679 · doi:10.1017/S0963548316000171
Abstract
We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $Ï$ has a limit distribution, after scaling by $n^{λ(Ï)/2}$ where $λ(Ï)$ is the length of $Ï$ plus the number of descents. The limit is not normal, and can be expressed as a functional of a Brownian excursion. Moments can be found by recursion.
32 pages