Black-box recognition of finite simple groups of Lie type by statistics of element orders

DOI10.1515/jgth.2002.010zbMath1015.20013OpenAlexW2090822074WikidataQ106072133 ScholiaQ106072133MaRDI QIDQ4779663

Seress, Ákos, László Babai, Péter P. Pálfy, William M. Kantor

Publication date: 31 July 2003

Published in: Journal of Group Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jgth.2002.010

zbMATH Keywords

Monte Carlo algorithmsfinite simple groups of Lie typeblack-box groupsuniformly distributed random elementsdivisibility statistics

Mathematics Subject Classification ID

Probabilistic methods in group theory (20P05)

Related Items

Prime power graphs for groups of Lie type ⋮ Recognising simplicity of black-box groups by constructing involutions and their centralisers. ⋮ Constructing composition factors for a linear group in polynomial time ⋮ Effective black-box constructive recognition of classical groups. ⋮ Black box exceptional groups of Lie type. II. ⋮ Constructive membership in black-box groups ⋮ A practical model for computation with matrix groups. ⋮ Constructive recognition of \(\text{SL}_3(q)\). ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Fast constructive recognition of black box symplectic groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Recognising the Suzuki groups in their natural representations. ⋮ A computer-assisted analysis of some matrix groups. ⋮ Fast constructive recognition of black box orthogonal groups. ⋮ Recognition of finite exceptional groups of Lie type ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ The graph of atomic divisors and recognition of finite simple groups ⋮ Black box exceptional groups of Lie type

Cites Work

• Composition Factors from the Group Ring and Artin's Theorem on Orders of Simple Groups
• Centralizers of Semisimple Elements in the Finite Classical Groups
• A Recognition Algorithm for Special Linear Groups
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item