Permutations with Confined Displacements
Canadian mathematical bulletin, Tome 4 (1961) no. 1, pp. 29-38
Voir la notice de l'article provenant de la source Cambridge
A fundamental problem in combinatorial analysis is the classification of the permutations of 1, 2, ..., n which satisfy a system of constraints. Thus one may ask such questions as how many permutations are there which have exactly r k-cycles; how many have at least s cycles regardless of cycle length. Again, one may ask how many permutations are there in which k ascending sequences appear; or how many permutations are there in which specified numbers may not appear in specified places or at specified distances from other numbers. The literature on these problems is quite extensive. References [1,2,5,7,10,14,17] give an indication of the present, status of these problems.
Mendelsohn, N. S. Permutations with Confined Displacements. Canadian mathematical bulletin, Tome 4 (1961) no. 1, pp. 29-38. doi: 10.4153/CMB-1961-005-4
@article{10_4153_CMB_1961_005_4,
author = {Mendelsohn, N. S.},
title = {Permutations with {Confined} {Displacements}},
journal = {Canadian mathematical bulletin},
pages = {29--38},
year = {1961},
volume = {4},
number = {1},
doi = {10.4153/CMB-1961-005-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1961-005-4/}
}
Cité par Sources :