Exact formula and asymptotic behavior for the expected number of inversions in a random permutation avoiding a pattern of length three
arXiv:2203.12510
Abstract
For , let denote the set of permutations in which avoid the pattern , and let denote the expectation with respect to the uniformly random probability measure on . Let denote the number of inversions in . We study for . We prove that and that From the first equation it follows that We also show that the variance of under satisfies
arXiv commentIt was brought to the author's attention that the results already appear in the literature. The expectation can be obtained from Theorem 1 in M. Bona's paper "The absence of a pattern and the occurrences of another". The asymptotic variance follows from (2.6) in S. Janson's paper "Patterns in Random Permutations Avoiding the Pattern 132".