Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements

DOI10.1007/BF02773374zbMath1015.20014MaRDI QIDQ5951506

Aner Shalev

Publication date: 24 April 2003

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite simple groups; random generation; \(p\)-regular elements; \(p\)-singular elements

Mathematics Subject Classification ID

20D60: Arithmetic and combinatorial problems involving abstract finite groups

20F05: Generators, relations, and presentations of groups

20D06: Simple groups: alternating groups and groups of Lie type

20P05: Probabilistic methods in group theory

Related Items

Unnamed Item, Generation and random generation: from simple groups to maximal subgroups.

Cites Work

• Unnamed Item
• On the probability that a group element is \(p\)-singular
• The probability of generating a finite simple group
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• Classical groups, probabilistic methods, and the \((2,3)\)-generation problem
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
• The probability of generating a finite classical group
• On the Number ofp-Regular Elements in Finite Simple Groups
• A Recognition Algorithm For Classical Groups Over Finite Fields
• On some problems of a statistical group-theory. II
• On the Overgroups of Irreducible Subgroups of the Finite Classical Groups
• On a class of doubly transitive groups
• The probability of generating the symmetric group
• The probability of generating the symmetric group