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

DOI10.1007/BF02773374zbMath1015.20014OpenAlexW2049020755MaRDI QIDQ5951506

Aner Shalev

Publication date: 24 April 2003

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

Full work available at URL: https://doi.org/10.1007/bf02773374

zbMATH Keywords

finite simple groupsrandom generation\(p\)-regular elements\(p\)-singular elements

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Simple groups: alternating groups and groups of Lie type (20D06) Probabilistic methods in group theory (20P05)

Related Items (2)

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

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

This page was built for publication: Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements