The probability of generating a finite classical group
From MaRDI portal
Publication:2639170
DOI10.1007/BF00181465zbMath0718.20011OpenAlexW2324705588MaRDI QIDQ2639170
William M. Kantor, Alexander Lubotzky
Publication date: 1990
Published in: Geometriae Dedicata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00181465
probabilitysymmetric groupalternating groupclassification of finite simple groupsrandomly chosen elementsfinite simple classical groupgenerating free profinite groups
Generators, relations, and presentations of groups (20F05) Asymptotic results on counting functions for algebraic and topological structures (11N45) Simple groups: alternating groups and groups of Lie type (20D06) Limits, profinite groups (20E18) Subgroups of symmetric groups (20B35) Probabilistic methods in group theory (20P05)
Related Items (95)
The Chebotarev Invariant of a Finite Group ⋮ Random equations in free groups ⋮ On the Random Generation of Finite Simple Classical Groups ⋮ Groups of intermediate subgroup growth and a problem of Grothendieck. ⋮ The probabilistic zeta function of finite simple groups. ⋮ A 2-generated just-infinite profinite group which is not positively generated. ⋮ A bound on the expected number of random elements to generate a finite group all of whose Sylow subgroups are \(d\)-generated ⋮ Unnamed Item ⋮ The expected number of random elements to generate a finite group ⋮ A zero-one law for random subgroups of some totally disconnected groups ⋮ Asymptotic results for primitive permutation groups ⋮ The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups ⋮ The probability of generating a finite simple group ⋮ Bias of group generators in finite and profinite groups: known results and open problems ⋮ On conjugacy classes of maximal subgroups of finite simple groups, and a related zeta function. ⋮ INTEGRAL MONODROMY GROUPS OF KLOOSTERMAN SHEAVES ⋮ The probability of generating a classical group ⋮ On Random Generation of the Symmetric Group ⋮ Highly transitive actions of \(\mathrm{Out}(F_n)\). ⋮ When do random subsets decompose a finite group? ⋮ On the uniform spread of almost simple symplectic and orthogonal groups ⋮ On the generating graph of direct powers of a simple group. ⋮ Maximal subgroups of direct products ⋮ The probability of generating a finite simple group. ⋮ On the number of matrices to generate a matrix \(\ast\)-algebra over the real field ⋮ Strong approximation in random towers of graphs. ⋮ Strongly dense free subgroups of semisimple algebraic groups. ⋮ GENERATION OF SECOND MAXIMAL SUBGROUPS AND THE EXISTENCE OF SPECIAL PRIMES ⋮ Presentations of finite simple groups: a computational approach. ⋮ Invariable generation and the Chebotarev invariant of a finite group. ⋮ Generating random elements of a finite group ⋮ Prefrattini subgroups and crowns ⋮ Random generation of the special linear group ⋮ Intersection growth in groups ⋮ Random equations in nilpotent groups. ⋮ Generation and random generation: from simple groups to maximal subgroups. ⋮ Random generation of finite and profinite groups and group enumeration. ⋮ Constructive recognition of classical groups in even characteristic. ⋮ Equations in simple matrix groups: algebra, geometry, arithmetic, dynamics. ⋮ Zero-one generation laws for finite simple groups ⋮ Random generation in semisimple algebraic groups over local fields. ⋮ Unnamed Item ⋮ Topological generation of special linear groups ⋮ The minimal number of generators of a finite semigroup. ⋮ Mixing and generation in simple groups. ⋮ Invariable generation of infinite groups. ⋮ Effective black-box constructive recognition of classical groups. ⋮ Black box exceptional groups of Lie type. II. ⋮ Covers and normal covers of finite groups. ⋮ Bias of group generators in the solvable case. ⋮ Simple groups, maximal subgroups, and probabilistic aspects of profinite groups ⋮ On the probability of generating prosoluble groups. ⋮ On the probability of generating free prosoluble groups of small rank. ⋮ A Solution to a Problem of Wiegold ⋮ Probabilistic finiteness properties for profinite groups ⋮ IMAGES OF WORD MAPS IN FINITE SIMPLE GROUPS ⋮ The generation of the augmentation ideal in profinite groups. ⋮ On the probability of generating a minimal d-generated group ⋮ On the subgroups with non-trivial Möbius number ⋮ Simple groups, permutation groups, and probability ⋮ Fuchsian groups, finite simple groups and representation varieties. ⋮ Probabilistic Generation of Wreath Products of Non-abelian Finite Simple Groups ⋮ Pairwise generating and covering sporadic simple groups. ⋮ Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements ⋮ A probabilistic version of a theorem of lászló kovács and hyo-seob sim ⋮ The number of maximal subgroups and probabilistic generation of finite groups ⋮ Random subgroups of Lie groups ⋮ On the generation of discrete and topological Kac-Moody groups. ⋮ Invariable generation of finite classical groups ⋮ PRESENTATIONS OF AFFINE KAC–MOODY GROUPS ⋮ Applications of character theory of finite simple groups ⋮ Random Möbius groups. I: Random subgroups of \(\operatorname{PSL}(2,\mathbb{R})\) ⋮ Maximal subgroups in finite and profinite groups ⋮ On the uniform domination number of a finite simple group ⋮ On fixed points of permutations. ⋮ Random generation of Thompson group \(F\) ⋮ Maximal cocliques in PSL2(q) ⋮ Commutator maps, measure preservation, and 𝑇-systems ⋮ Probabilistic generation of finite classical groups in odd characteristic by involutions ⋮ Babai's conjecture for high-rank classical groups with random generators ⋮ Expander graphs in pure and applied mathematics ⋮ Probabilistic and Asymptotic Aspects of Finite Simple Groups ⋮ On the probability of satisfying a word in a group ⋮ Hamiltonian paths in Cayley graphs ⋮ Algebra--12. Dedicated to the 70th birthday of Professor A. I. Kostrikin ⋮ \(p\)-large representations and asymptotics: a survey and conjectures ⋮ Probabilistic generation of finite simple groups ⋮ Beauville Surfaces and Probabilistic Group Theory ⋮ Random generation of finite simple groups ⋮ CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP ⋮ The expected number of random elements to generate a finite group. ⋮ How many elements are needed to generate a finite group with good probability? ⋮ Generation of classical groups ⋮ Unnamed Item ⋮ An algorithm for the principal ideal problem in indefinite quaternion algebras
This page was built for publication: The probability of generating a finite classical group
