A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated

DOI10.1007/s00013-016-0917-zzbMath1359.20043arXiv1603.08098OpenAlexW2331737724MaRDI QIDQ2629077

Andrea Lucchini

Publication date: 19 July 2016

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.08098

zbMATH Keywords

permutation groupswaiting timeSylow subgroupsprofinite groupsgroups generation

Mathematics Subject Classification ID

Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Generators, relations, and presentations of groups (20F05) Limits, profinite groups (20E18) Probabilistic methods in group theory (20P05)

Related Items

The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups, A probabilistic version of a theorem of lászló kovács and hyo-seob sim, Bounding the maximal size of independent generating sets of finite groups

Cites Work

• Unnamed Item
• Unnamed Item
• The expected number of random elements to generate a finite group
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• Cohomological characterisations of finite solvable and nilpotent groups
• 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.
• The probability of generating a finite classical group
• Endliche Gruppen I
• On the number of generators of a finite group
• The expected number of random elements to generate a finite Abelian group