A probabilistic version of a theorem of László Kovács and Hyo-Seob Sim
From MaRDI portal
Publication:5124339
Recommendations
- The probability of generating a soluble subgroup of a finite group
- The probability of generating a finite soluble group.
- Probabilistic generation of finite groups with a unique minimal normal subgroup.
- How many elements are needed to generate a finite group with good probability?
- On the probability of generating finite groups with a unique minimal normal subgroup.
Cites work
- A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
- Classes of Finite Groups
- Generating finite soluble groups
- On groups withd-generator subgroups of coprime index
- Pre-Frattini groups.
- The expected number of random elements to generate a finite group.
- The probability of generating a finite classical group
Cited in
(6)- scientific article; zbMATH DE number 7359829 (Why is no real title available?)
- The probability of generating a soluble subgroup of a finite group
- scientific article; zbMATH DE number 3890084 (Why is no real title available?)
- A probabilistic version of a theorem of Kegel.
- Simplified probabilistic approach to the Hörmander theorem
- The expected number of random elements to generate a finite group.
This page was built for publication: A probabilistic version of a theorem of László Kovács and Hyo-Seob Sim
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124339)