Commuting probabilities of finite groups
arXiv:1411.0848 · doi:10.1112/blms/bdv050
Abstract
The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is nearly an Egyptian fraction of bounded complexity. As a corollary we deduce two conjectures of Keith Joseph from 1977: all limit points of P are rational, and P is well ordered by >. We also prove analogous theorems for bilinear maps of abelian groups.
13 pages. To appear in the Bulletin of the LMS. This is the version accepted for publication, incorporating the referee's suggestions. This version will differ from the published version
Cited by in corpus (12)
- Commuting probabilities of infinite groups
- On the commuting probability of p-elements in a finite group
- Probabilistically nilpotent groups of class two
- Conjugacy classes of -elements and nilpotent/abelian Hall -subgroups
- Schur's colouring theorem for non-commuting pairs
- Biased multilinear maps of abelian groups
- Commuting probability in algebraic groups
- Commuting Probability of Finite Groups (Extended)
- On the common transversal probability in finite groups
- Graphs defined on groups
- A Note On Square-free Commuting Probabilities of Finite Rings
- Finite groups with five relative commutativity degrees