Simple groups, permutation groups, and probability

MaRDI QIDQ1126712zbMATH OpenFDO

Authors Aner Shalev

Publication date 6 August 1998

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/232867, http://www.emis.de/journals/DMJDMV/xvol-icm/02/Shalev.MAN.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Dixon's conjecturegroup generatorsmaximal subgroupspairs of elementsprobabilistic methodssimple groupsWall's conjecture

Mathematics Subject Classification ID

Simple groups: alternating groups and groups of Lie type (20D06) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)

Review text

This paper surveys recent results in group theory which have been obtained by `probabilistic methods' (which really means counting arguments). The prototype for these is Dixon's conjecture that (as the order of the group tends to infinity) almost all pairs of elements in a simple group actually generate the group. Naturally, this is intimately connected with the subgroup structure of the group, and especially the maximal subgroups. Thus the proofs rely on deep knowledge of maximal subgroups, and ultimately on the classification theorem for finite simple groups. Indeed, the methods may also be applied to proving cases of Wall's conjecture, that the number of maximal subgroups of a (finite) group is less than the order of the group. This bound is attained for elementary abelian 2-groups, while at the other extreme, for simple groups, the bound appears to be very weak, but also very hard to prove. A number of other related results and conjectures are discussed.

Recommendations

• Simple groups, permutation groups, and probability
• scientific article; zbMATH DE number 822329
• Simple Groups, Generation and Probabilistic Methods
• Permutation groups, simple groups, and sieve methods
• On random permutations of finite groups
• Random Permutations: Some Group-Theoretic Aspects
• scientific article; zbMATH DE number 1047717
• scientific article; zbMATH DE number 1157205
• The probability of generating a finite simple group

Cited in

(9)

• On the probability of generating free prosoluble groups of small rank.
• On the commuting probability in finite groups.
• The probability of generating a finite soluble group.
• Probabilistic and asymptotic aspects of finite simple groups.
• scientific article; zbMATH DE number 1222256 (Why is no real title available?)
• scientific article; zbMATH DE number 1047717 (Why is no real title available?)
• Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups
• Prefrattini subgroups and crowns
• Random generation of finite and profinite groups and group enumeration.

This page was built for publication: Simple groups, permutation groups, and probability

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