ON THE COMMUTING PROBABILITY IN FINITE GROUPS

By Robert M. Guralnick, Geoffrey R. Robinson. 2006

153 citations recorded by the source corpus.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/6814b770743ff5296b292cea2327d82873d7276c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

1. Peter J. Cameron
2. Jason E. Fulman
3. Robert M. Guralnick
4. Sourav Chatterjee
5. Leandro Vendramin
6. Aner Shalev
7. Martin W. Liebeck

In Geometry and Topology

1. Jason E. Fulman
2. Peter J. Cameron
3. Robert M. Guralnick
4. Jim Pitman
5. Kent E. Morrison
6. Leandro Vendramin

Citations in the corpus

• Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements (2009, methodology): “They were used in [ GR ] in obtaining new results about the commuting probability in finite groups.”
• Graphs defined on groups (2021, background): “Closely related is the fact that the commuting ratio of a group G, the probability that two randomly-chosen elements commute, is the ratio of the number of ordered edges of the commuting graph (including loops) to |G|(2): see for example [58, 46].”