The average order of a permutation

MaRDI QIDQ1266751zbMATH OpenFDO

Authors Richard A. Stong

Publication date 8 October 1998

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119668, http://www.emis.de/journals/EJC/Volume_5/Abstracts/v5i1r41.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

symmetric groupasymptotic formula for the expected order of a random permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic results on arithmetic functions (11N37) Symmetric groups (20B30) Analytic theory of partitions (11P82) Probabilistic methods in group theory (20P05) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Recommendations

• The Expected order of a Random Permutation
• On the Erdős-Turán theorem on the logarithm of the order of a random permutation
• A limit theorem for the logarithm of the order of a random A-permutation

Cited in

(10)

• Medians of an odd number of permutations
• A note on Goldbach partitions of large even integers
• The average number of block interchanges needed to sort a permutation and a recent result of Stanley
• Periods of iterations of mappings over finite fields with restricted preimage sizes
• The expected order of a random unitary matrix
• How permutations displace points and stretch intervals.
• The Order of Automorphisms of Quasigroups
• The average order of a matrix
• Proof of a conjecture of Erdős and Turán
• Splitting fields for characteristic polynomials of matrices with entries in a finite field

This page was built for publication: The average order of a permutation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266751)