The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
From MaRDI portal
Publication:1627604
DOI10.1216/RMJ-2018-48-6-1963zbMath1499.20204arXiv1707.07193OpenAlexW2964093002MaRDI QIDQ1627604
Mariapia Moscatiello, Andrea Lucchini
Publication date: 30 November 2018
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.07193
Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Probabilistic methods in group theory (20P05)
Uses Software
Cites Work
- Unnamed Item
- The expected number of random elements to generate a finite group
- Die Eulersche Funktion endlicher auflösbarer Gruppen
- Finite permutation groups with large Abelian quotients
- A bound on the number of generators of a finite group
- The expected number of random elements to generate a finite group.
- Subgroup growth.
- A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
- On minimal faithful permutation representations of finite groups
- On the number of generators of a finite group
- The expected number of random elements to generate a finite Abelian group
This page was built for publication: The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups