Bounding the maximal size of independent generating sets of finite groups
DOI10.1017/prm.2020.6zbMath1477.20065arXiv1908.01160OpenAlexW3001584762WikidataQ126291642 ScholiaQ126291642MaRDI QIDQ4965407
Pablo Spiga, Mariapia Moscatiello, Andrea Lucchini
Publication date: 1 March 2021
Published in: Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.01160
Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05) Symmetric groups (20B30)
Related Items (1)
Cites Work
- Unnamed Item
- The largest size of a minimal generating set of a finite group.
- Minimal generating sets of maximal size in finite monolithic groups.
- A generalization of the Burnside basis theorem.
- Maximal independent generating sets of the symmetric group
- A bound on the number of generators of a finite group
- Independent generating sets and geometries for symmetric groups
- On the maximal size of independent generating sets of \(\text{PSL}_2(q)\)
- On finite simple groups of order divisible by three primes only
- Approximate formulas for some functions of prime numbers
- A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
- Composition Factors from the Group Ring and Artin's Theorem on Orders of Simple Groups
- Endliche Gruppen I
- Explicit Bounds for Some Functions of Prime Numbers
- On the number of generators of a finite group
This page was built for publication: Bounding the maximal size of independent generating sets of finite groups
