Random generation of finite and profinite groups and group enumeration.

DOI10.4007/ANNALS.2011.173.2.4zbMATH Open1234.20042OpenAlexW2044629761WikidataQ105891223 ScholiaQ105891223MaRDI QIDQ640754FDOQ640754

Laszló 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

Recommendations

• Generating random elements in finite groups.
• Random generation of finite simple groups
• On the Random Generation of Finite Simple Classical Groups
• RANDOM (r, s)-GENERATION OF FINITE CLASSICAL GROUPS
• Probabilistic generation of finite simple groups
• Probabilistic generation of finite simple groups. II.
• Generation and random generation: from simple groups to maximal subgroups.
• scientific article
• Minimal and random generation of permutation and matrix groups.
• RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP

zbMATH Keywords

finite groupsprofinite groupssubgroup growthprimitive groupspermutation representationsnumbers of random elementsPFG groupspositively finitely generated groupsrandom generations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (33)

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

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

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