On the Generating Function for Permutations with Repetitions and Inversions
Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 101-102
Voir la notice de l'article provenant de la source Cambridge
Let (a1, a2, ..., am), a i ∊ {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 = k 1+ ...+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.
Abramson, Morton. On the Generating Function for Permutations with Repetitions and Inversions. Canadian mathematical bulletin, Tome 14 (1971) no. 1, pp. 101-102. doi: 10.4153/CMB-1971-017-4
@article{10_4153_CMB_1971_017_4,
author = {Abramson, Morton},
title = {On the {Generating} {Function} for {Permutations} with {Repetitions} and {Inversions}},
journal = {Canadian mathematical bulletin},
pages = {101--102},
year = {1971},
volume = {14},
number = {1},
doi = {10.4153/CMB-1971-017-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-017-4/}
}
TY - JOUR AU - Abramson, Morton TI - On the Generating Function for Permutations with Repetitions and Inversions JO - Canadian mathematical bulletin PY - 1971 SP - 101 EP - 102 VL - 14 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1971-017-4/ DO - 10.4153/CMB-1971-017-4 ID - 10_4153_CMB_1971_017_4 ER -
Cité par Sources :