Journal article
The Expected order of a Random Permutation
The Bulletin of the London Mathematical Society, v 23(1), pp 34-42
Jan 1991
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
Let μn be the expected order of a random permutation, that is, the arithmetic mean of the orders of the elements in the symmetric group Sn. We prove that log μn ñ c√(n/logn) as n → ∞, where c=2(2∫0∞loglog(e1-e-t)dt).
Metrics
Details
- Title
- The Expected order of a Random Permutation
- Creators
- William M. Y. Goh - Drexel UniversityEric Schmutz - Drexel University
- Publication Details
- The Bulletin of the London Mathematical Society, v 23(1), pp 34-42
- Publisher
- Oxford University Press
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- [Retired Faculty]; Mathematics
- Web of Science ID
- WOS:A1991GE38500002
- Scopus ID
- 2-s2.0-85008730769
- Other Identifier
- 991019173913004721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Mathematics