The expected number of random elements to generate a finite group
DOI10.1007/S00605-015-0789-5zbMATH Open1383.20041OpenAlexW2211042330MaRDI QIDQ314490FDOQ314490
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
Recommendations
- The expected number of random elements to generate a finite Abelian group
- scientific article; zbMATH DE number 908573
- Some new results in probabilistic group theory
- The probability of randomly generating finite Abelian groups.
- scientific article; zbMATH DE number 2114353
- When do random subsets decompose a finite group?
- Strongly generating elements in finite and profinite groups
- Random multiplication approaches uniform measure in finite groups
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)
Cites Work
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Positively finitely generated groups
- THE EULERIAN FUNCTIONS OF A GROUP
- The expected number of random elements to generate a finite group.
- Subgroup growth.
- The probability of generating a finite simple group
- On the probability of generating free prosoluble groups of small rank.
- The probability of generating a finite classical group
- Probability and bias in generating supersoluble groups
- Title not available (Why is that?)
- The probability of generating a finite simple group.
- The Subgroups of M24, or How to Compute the Table of Marks of a Finite Group
- The X-Dirichlet polynomial of a finite group
- On the probabilistic ζ-function of pro(finite-soluble) groups
- The probability of generating the symmetric group
- The expected number of random elements to generate a finite Abelian group
- Bounds for the probability of generating the symmetric and alternating groups.
- Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
Cited In (7)
- The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly generating elements in finite and profinite groups
Uses Software
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)