The probability that a pair of elements of a finite group are conjugate
arXiv:1108.1784 · doi:10.1112/jlms/jds022
Abstract
Let be a finite group, and let be the probability that elements , are conjugate, when and are chosen independently and uniformly at random. The paper classifies those groups such that , and shows that is abelian whenever . It is also shown that depends only on the isoclinism class of . Specialising to the symmetric group , the paper shows that for an explicitly determined constant . This bound leads to an elementary proof of a result of Flajolet \emph{et al}, that as for some constant . The same techniques provide analogous results for , the probability that two elements of the symmetric group have conjugates that commute.
34 pages, corrected version, to appear in Journal of the London Mathematical Society
Cited by in corpus (7)
- Considerations on the subgroup commutativity degree and related notions
- Permutability degrees of finite groups
- A note on invariable generation of nonsolvable permutation groups
- The range of thresholds for diameter 2 in random Cayley graphs
- Asypmtotic Behaviour of the Conjugacy Probability of the Alternating Group
- On the common transversal probability in finite groups
- Groups that have a Partition by Commuting Subsets