3 citations · 4 across the 2 of their papers we have counts for
2 papers
math.GR2008★ 1 cited
Presentations of finite simple groups: a computational approach
R. M. Guralnick, W. M. Kantor, M. Kassabov +1
All nonabelian finite simple groups of rank over a field of size , with the possible exception of the Ree groups , have presentations with at most rel…
math.GR2007★ 3 cited
Presentations of Finite Simple Groups: Profinite and Cohomological Approaches
Robert Guralnick, William M. Kantor, Martin Kassabov +1
We prove the following three closely related results. The first is that every finite simple group has a profinite presentation with 2 generators and at most 18 relations. The secon…