A probabilistic version of a theorem of László Kovács and Hyo-Seob Sim

DOI10.22108/IJGT.2018.112531.1496zbMATH Open1443.20096OpenAlexW2901577223MaRDI QIDQ5124339FDOQ5124339

Authors: Mariapia Moscatiello, Andrea Lucchini 

Publication date: 18 September 2020

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

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.

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)

Cites Work

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

Cited In (6)

• Simplified probabilistic approach to the Hörmander theorem
• A probabilistic version of a theorem of Kegel.
• Title not available (Why is that?)
• The expected number of random elements to generate a finite group.
• The probability of generating a soluble subgroup of a finite group
• Title not available (Why is that?)

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)