Article contents
On the Generating Function for Permutations with Repetitions and Inversions
Published online by Cambridge University Press: 20 November 2018
Extract
Let (a1, a2, …, am), ai ∊ {l, 2, …, n}, be an m-permutation of n (repetitions allowed) with exactly kj of the a's equal to j, j = 1, 2, …, n, m = k1+ …+kn, fixed nonnegative integers. An inversion is a pair i, j such that i < j, ai > aj. Denote by N(r; k, …, kn) the number of such permutations with exactly r inversions.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1971
References
- 1
- Cited by