Random generation of finite and profinite groups and group enumeration.

DOI10.4007/annals.2011.173.2.4zbMath1234.20042OpenAlexW2044629761WikidataQ105891223 ScholiaQ105891223MaRDI QIDQ640754

László Pyber, Andrei Jaikin-Zapirain

Publication date: 20 October 2011

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4007/annals.2011.173.2.4

zbMATH Keywords

finite groupssubgroup growthpermutation representationsprimitive groupsprofinite groupsnumbers of random elementsPFG groupspositively finitely generated groupsrandom generations

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Residual properties and generalizations; residually finite groups (20E26) Primitive groups (20B15) Limits, profinite groups (20E18) Probabilistic methods in group theory (20P05)

Related Items (24)

Comparing the order and the minimal number of generators of a finite irreducible linear group ⋮ A proof of Pyber's base size conjecture ⋮ Positively finitely related profinite groups ⋮ On subgroups with non-zero Möbius numbers in the alternating and symmetric groups. ⋮ Unnamed Item ⋮ GENERATION OF SECOND MAXIMAL SUBGROUPS AND THE EXISTENCE OF SPECIAL PRIMES ⋮ Strongly generating elements in finite and profinite groups ⋮ Prefrattini subgroups and crowns ⋮ Counting irreducible modules for profinite groups ⋮ Random generation of associative algebras ⋮ CLASSIFICATION OF FINITE GROUPS VIA THEIR BREADTH ⋮ Generation and random generation: from simple groups to maximal subgroups. ⋮ The growth of abelian sections ⋮ A finitely generated just-infinite profinite branch group which is not positively finitely generated. ⋮ The minimal number of generators of a finite semigroup. ⋮ Invariable generation of permutation and linear groups ⋮ Maximal subgroup growth of a few polycyclic groups ⋮ The generation of the augmentation ideal in profinite groups. ⋮ The number of maximal subgroups and probabilistic generation of finite groups ⋮ Random generation of Thompson group \(F\) ⋮ An improved diameter bound for finite simple groups of Lie type ⋮ Probabilistic and Asymptotic Aspects of Finite Simple Groups ⋮ Characterization of finitely generated infinitely iterated wreath products ⋮ Maximal subgroup growth of some metabelian groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normalizers of primitive permutation groups
• Simple groups, maximal subgroups, and probabilistic aspects of profinite groups
• Enumerating finite groups and their defining relations. II.
• On finitely generated profinite groups. I: Strong completeness and uniform bounds. II: Products in quasisimple groups.
• On the verbal width of finitely generated pro-\(p\) groups.
• Simple groups, permutation groups, and probability
• On the orders of primitive groups with restricted nonabelian composition factors
• Walks on generating sets of groups
• The probability of generating certain profinite groups by two elements
• Asymptotic results for primitive permutation groups
• Groups with super-exponential subgroup growth
• Crowns and factorization of the probabilistic zeta function of a finite group.
• Polynomial representation growth and the congruence subgroup problem.
• Enumerating finite groups of given order
• Bases of primitive linear groups.
• The expected number of random elements to generate a finite group.
• Subgroup growth.
• A 2-generated just-infinite profinite group which is not positively generated.
• Subgroup growth and congruence subgroups
• The probability of generating a finite simple group
• Asymptotic results for primitive permutation groups and irreducible linear groups.
• Enumerating finite groups without Abelian composition factors.
• Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
• The probability of generating a finite classical group
• The product replacement algorithm and Kazhdan’s property (T)
• POLYNOMIAL INDEX GROWTH GROUPS
• Residual properties of groups and probabilistic methods
• ENUMERATING FINITE GROUPS
• ON SUBGROUPS OF FINITE INDEX IN POSITIVELY FINITELY GENERATED GROUPS
• On the orders of Primitive Permutation Groups
• The Number of Non-Solvable Sections in Linear Groups
• Automorphism Groups of Groups with Trivial Centre
• Simple groups, permutation groups, and probability
• Maximal subgroups in finite and profinite groups
• Generating random elements of a finite group
• Positively finitely generated groups
• Polynomial-time theory of matrix groups
• PROBABILISTIC GENERATION OF WREATH PRODUCTS OF NON-ABELIAN FINITE SIMPLE GROUPS, II
• AN ENUMERATION THEOREM FOR FINITE GROUPS
• The Structure and Order of the Group of Central Automorphisms of a Finite Group^*
• Maximal subgroups of finite groups
• The probability of generating the symmetric group
• The probability of generating the symmetric group
• Enumerating boundedly generated finite groups.

This page was built for publication: Random generation of finite and profinite groups and group enumeration.