A probabilistic version of a theorem of lászló kovács and hyo-seob sim

DOI10.22108/ijgt.2018.112531.1496zbMath1443.20096OpenAlexW2901577223MaRDI QIDQ5124339

Mariapia Moscatiello, Andrea Lucchini

Publication date: 18 September 2020

Full work available at URL: https://doaj.org/article/79e695515f914decbb8a1708055451aa

zbMATH Keywords

finite soluble groupsgeneration of finite groups

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Probabilistic methods in group theory (20P05)

Related Items (1)

Unnamed Item

Cites Work

• Pre-Frattini groups.
• Generating finite soluble groups
• The expected number of random elements to generate a finite group.
• A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
• The probability of generating a finite classical group
• On groups withd-generator subgroups of coprime index
• Classes of Finite Groups

This page was built for publication: A probabilistic version of a theorem of lászló kovács and hyo-seob sim