Geodesic
Cycle lengths in a permutation are typically Poisson
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
The set of cycle lengths of almost all permutations in $S_n$ are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the permutation. The formulas we develop allow us to also show that almost all permutations with a given number of cycles have a certain "normal order" (in the spirit of the Erdős-Turán theorem). Our results were inspired by analogous questions about the size of the prime divisors of "typical" integers.
DOI : 10.37236/1133
Classification : 05A05, 60C05 
Andrew Granville. Cycle lengths in a permutation are typically Poisson. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1133
@article{10_37236_1133,
     author = {Andrew Granville},
     title = {Cycle lengths in a permutation are typically {Poisson}},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1133},
     zbl = {1171.05001},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1133/}
}
TY  - JOUR
AU  - Andrew Granville
TI  - Cycle lengths in a permutation are typically Poisson
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1133/
DO  - 10.37236/1133
ID  - 10_37236_1133
ER  - 
%0 Journal Article
%A Andrew Granville
%T Cycle lengths in a permutation are typically Poisson
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1133/
%R 10.37236/1133
%F 10_37236_1133

Cité par Sources :