Permutations with inversions
Journal of integer sequences, Tome 4 (2001) no. 2
The number of inversions in a random permutation is a way to measure the extent to which the permutation is "out of order". Let $I_{n}(k)$ denote the number of permutations of length n with k inversions. This paper gives asymptotic formulae for the sequences ${I_{n+k}(n)$, n=1,2,$\dots }$ for fixed k.
@article{JIS_2001__4_2_a0,
author = {Margolius, Barbara H.},
title = {Permutations with inversions},
journal = {Journal of integer sequences},
year = {2001},
volume = {4},
number = {2},
zbl = {0988.05007},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2001__4_2_a0/}
}
Margolius, Barbara H. Permutations with inversions. Journal of integer sequences, Tome 4 (2001) no. 2. http://geodesic.mathdoc.fr/item/JIS_2001__4_2_a0/