Permutations with Inversions
Abstract
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,... for fixed k.
- Publication:
-
Journal of Integer Sequences
- Pub Date:
- October 2001
- Bibcode:
- 2001JIntS...4...24M
- Keywords:
-
- Number Theory