Discrete limit laws for additive functions on the symmetric group
Communications in Mathematics, Tome 13 (2005) no. 1, pp. 47-55
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Inspired by probabilistic number theory, we establish necessary and sufficient conditions under which the numbers of cycles with lengths in arbitrary sets posses an asymptotic limit law. The approach can be extended to deal with the counts of components with the size constraints for other random combinatorial structures.
Classification :
05A16, 05D40, 60C05
Keywords: random permutation; cycle structure; Poisson distribution; factorial moment
Keywords: random permutation; cycle structure; Poisson distribution; factorial moment
@article{COMIM_2005__13_1_a5,
author = {Manstavi\v{c}ius, Eugenijus},
title = {Discrete limit laws for additive functions on the symmetric group},
journal = {Communications in Mathematics},
pages = {47--55},
publisher = {mathdoc},
volume = {13},
number = {1},
year = {2005},
mrnumber = {2290418},
zbl = {1200.60012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/COMIM_2005__13_1_a5/}
}
Manstavičius, Eugenijus. Discrete limit laws for additive functions on the symmetric group. Communications in Mathematics, Tome 13 (2005) no. 1, pp. 47-55. http://geodesic.mathdoc.fr/item/COMIM_2005__13_1_a5/