The expected number of random elements to generate a finite group

DOI10.1007/S00605-015-0789-5MaRDI QIDQ314490zbMATHOpenAlexFDO

Authors Andrea Lucchini

Publication date 16 September 2016

Published in Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11577/3210788

zbMATH Keywords

profinite groupsgroups generationpermutations groupswaiting time

Mathematics Subject Classification ID

Symmetric groups (20B30) Limits, profinite groups (20E18) Generators, relations, and presentations of groups (20F05) Finite simple groups and their classification (20D05) Probabilistic methods in group theory (20P05)

Recommendations

• The expected number of random elements to generate a finite Abelian group
• Publication:4887957
• Some new results in probabilistic group theory
• The probability of randomly generating finite Abelian groups.
• Publication:4826081
• When do random subsets decompose a finite group?
• Strongly generating elements in finite and profinite groups

Cites work

• scientific article; zbMATH DE number 5532013 (Why is no real title available?)
• Bounds for the probability of generating the symmetric and alternating groups.
• Crowns and factorization of the probabilistic zeta function of a finite group.
• On the probabilistic ζ-function of pro(finite-soluble) groups
• On the probability of generating free prosoluble groups of small rank.
• Positively finitely generated groups
• Probability and bias in generating supersoluble groups
• Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
• Subgroup growth.
• THE EULERIAN FUNCTIONS OF A GROUP
• The Subgroups of M₂₄, or How to Compute the Table of Marks of a Finite Group
• The X-Dirichlet polynomial of a finite group
• The expected number of random elements to generate a finite Abelian group
• The expected number of random elements to generate a finite group.
• The probability of generating a finite classical group
• The probability of generating a finite simple group
• The probability of generating a finite simple group.
• The probability of generating the symmetric group

Cited in

(7)

• scientific article; zbMATH DE number 7359829 (Why is no real title available?)
• A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated
• Comparing the expected number of random elements from the symmetric and the alternating groups needed to generate a transitive subgroup
• The expected number of random elements to generate a finite Abelian group
• The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
• Minimal generating sequences of \(\mathfrak{F}\)-subgroups
• Strongly generating elements in finite and profinite groups

Describes a project that uses

Uses Software

• GAP

This page was built for publication: The expected number of random elements to generate a finite group

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