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-ZMaRDI QIDQ2629077zbMATH OpenOpenAlexFDO

Authors 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

groups generationpermutation groupsprofinite groupsSylow subgroupswaiting time

Mathematics Subject Classification ID

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

Abstract: Assume that all the Sylow subgroups of a finite group $G$ can be generated by $d$ elements. Then the expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found, is at most $d+eta$ with $etasim\mathrm{2.875065.}$

Recommendations

• The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
• How many elements are needed to generate a finite group with good probability?
• The expected number of random elements to generate a finite group.
• Random generation of finite and profinite groups and group enumeration.
• The probability of generating a permutation group.

Cites work

• A bound on the number of generators of a finite group
• Cohomological characterisations of finite solvable and nilpotent groups
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• Endliche Gruppen I
• Finite permutation groups with large Abelian quotients
• scientific article; zbMATH DE number 1140695 (Why is no real title available?)
• scientific article; zbMATH DE number 2236723 (Why is no real title available?)
• On the number of generators of a finite group
• Subgroup growth.
• The expected number of random elements to generate a finite Abelian group
• The expected number of random elements to generate a finite group
• The expected number of random elements to generate a finite group.
• The probability of generating a finite classical group

Cited in

(7)

• The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
• A bound on the number of generators of a finite group
• Strongly generating elements in finite and profinite groups
• Bounding the maximal size of independent generating sets of finite groups
• scientific article; zbMATH DE number 7359829 (Why is no real title available?)
• A probabilistic version of a theorem of László Kovács and Hyo-Seob Sim
• The expected number of random elements to generate a finite Abelian group

This page was built for publication: A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629077)