Abstract
The paper remarks on the average number of cycles of the elements of a finite permutation group in general and computes this number for the alternating groups and wreath products using the cycle number indicator.
Similar content being viewed by others
References
Celler F. et al.: Generating random elements of a finite group. Comm. Algebra 23, 4931–4948 (1995)
V. L. Gončarov, On the field of combinatory analysis, American Mathematical Society Translations, Ser. 2, vol. 19, 12 Papers on Number Theory and Function Theory, 1962, 1–46 (Гohчapob, B. Л., И_3 oблactи кomбиhatopики, Izv. Akad. Nauk SSSR. Ser. Mat. 8 (1944), 3–48).
G. Grimmett and D. Stirzaker, Probability and Random Processes, Oxford University Press, 1982.
Holt D., O’Brien E.: A computer-assisted analysis of some matrix groups. J. Algebra 300, 199–212 (2006)
A. Kerber, Applied finite group actions, 2nd ed., Algorithms and Combinatorics 19. Springer-Verlag, Berlin, 1999.
C. Leedham-Green, The computational matrix group project, Groups and computation, III (Columbus, OH, 1999), 229–247, Ohio State Univ. Math. Res. Inst. Publ. 8, de Gruyter, Berlin, 2001.
Niemeyer A.C., Praeger C.E.: On the frequency of permutations containing a long cycle. J. Algebra 300, 289–304 (2006)
Pólya G.: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math. 68, 145–254 (1937)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Plesken, W., Robertz, D. The average number of cycles. Arch. Math. 93, 445–449 (2009). https://doi.org/10.1007/s00013-009-0045-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00013-009-0045-0