The expected number of random elements to generate a finite Abelian group

DOI10.1023/A:1015250102792zbMath0980.20079OpenAlexW1736900933MaRDI QIDQ5948361

Carl B. Pomerance

Publication date: 5 November 2001

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015250102792

zbMATH Keywords

finite Abelian groupsnumbers of generators

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Asymptotic results on counting functions for algebraic and topological structures (11N45) Finite abelian groups (20K01) Probabilistic methods in group theory (20P05)

Related Items (15)

The Chebotarev Invariant of a Finite Group ⋮ 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 ⋮ The expected number of random elements to generate a finite group ⋮ Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) ⋮ On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices ⋮ Strongly generating elements in finite and profinite groups ⋮ Random generation of associative algebras ⋮ Unnamed Item ⋮ On the probability of generating a lattice ⋮ The number of maximal subgroups and probabilistic generation of finite groups ⋮ Invariable generation of finite classical groups ⋮ Structure computation and discrete logarithms in finite abelian $p$-groups ⋮ The expected number of random elements to generate a finite group. ⋮ An upper bound on the Chebotarev invariant of a finite group

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