The expected number of elements to generate a finite group with d-generated Sylow subgroups

DOI10.1216/RMJ-2018-48-6-1963MaRDI QIDQ1627604zbMATH OpenOpenAlexFDO

Authors Andrea Lucchini, Mariapia Moscatiello

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, https://projecteuclid.org/euclid.rmjm/1543028448

zbMATH Keywords

groups generationpermutation groupsSylow subgroupswaiting time

Mathematics Subject Classification ID

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)

Abstract: Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then $e(G)leqd+kappa$ with $kappasim\mathrm{2.75239495.}$ The number $kappa$ is explicitly described in terms of the Riemann zeta function and is best possible. If $G$ is a permutation group of degree $n,$ then either $G=S_3$ and $e(G)=2.9$ or $e(G)leqlfloorn/2floor+kapp{a}^{\ast }$ with $kapp{a}^{\ast }sim\mathrm{1.606695.}$

Recommendations

• A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
• scientific article; zbMATH DE number 908573
• The expected number of random elements to generate a finite group.
• The expected number of random elements to generate a finite group
• How many elements are needed to generate a finite group with good probability?

Cites work

• A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
• A bound on the number of generators of a finite group
• Die Eulersche Funktion endlicher auflösbarer Gruppen
• Finite permutation groups with large Abelian quotients
• scientific article; zbMATH DE number 1076948 (Why is no real title available?)
• On minimal faithful permutation representations of finite groups
• 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.

Cited in

(4)

• How many elements are needed to generate a finite group with good probability?
• Minimal and random generation of permutation and matrix groups.
• A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
• The expected number of random elements to generate a finite Abelian group

Describes a project that uses

Uses Software

• GAP
• PARI/GP

This page was built for publication: The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups

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