Generating random elements of a finite group
From MaRDI portal
Publication:4857408
DOI10.1080/00927879508825509zbMath0836.20094OpenAlexW2020524208MaRDI QIDQ4857408
F. Celler, Murray, Scott H., E. A. O'Brien, Alice C. Niemeyer, Charles R. Leedham-Green
Publication date: 1 January 1996
Published in: Communications in Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00927879508825509
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)
Related Items
A black-box group algorithm for recognizing finite symmetric and alternating groups, I ⋮ Interview with Igor Pak ⋮ Right order spectral gap estimates for generating sets of ℤ4 ⋮ Prime power graphs for groups of Lie type ⋮ A Markov chain with number-theoretic limit distribution ⋮ Product Replacement in the Monster ⋮ The limiting distribution of the product replacement algorithm for finitely generated prosoluble groups ⋮ CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS ⋮ Bias of group generators in finite and profinite groups: known results and open problems ⋮ Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\) ⋮ RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS ⋮ Walks on generating sets of Abelian groups ⋮ On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\) ⋮ The spread of a finite group ⋮ A new method for recognising Suzuki groups ⋮ Irreducibility testing of finite nilpotent linear groups. ⋮ Strong uniform expansion in \(\text{SL}(2,p)\). ⋮ A note on computing involution centralizers. ⋮ Recognising the small Ree groups in their natural representations. ⋮ Improved Lower Bounds for Kissing Numbers in Dimensions 25 through 31 ⋮ Constructing composition factors for a linear group in polynomial time ⋮ On a variant of the product replacement algorithm ⋮ Arithmetic and dynamics on varieties of Markoff type ⋮ The maximal size of a minimal generating set ⋮ A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model ⋮ Zariski density and computing in arithmetic groups ⋮ Random generation of finite and profinite groups and group enumeration. ⋮ Constructive recognition of classical groups in even characteristic. ⋮ The product replacement algorithm and Kazhdan’s property (T) ⋮ Probability and Bias in Generating Supersoluble Groups ⋮ Constructive recognition of classical groups in their natural representation. ⋮ The product replacement prospector. ⋮ Effective black-box constructive recognition of classical groups. ⋮ Constructive membership in black-box groups ⋮ Connectivity of the product replacement algorithm graph of PSL(2, q) ⋮ Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture ⋮ Orbit invariants and an application to the Baby Monster. ⋮ A practical model for computation with matrix groups. ⋮ Constructive recognition of \(\text{SL}_3(q)\). ⋮ Bias of group generators in the solvable case. ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Fast constructive recognition of black box symplectic groups. ⋮ Connectivity of the product replacement graph of simple groups of bounded Lie rank. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Random matrix theory over finite fields ⋮ THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS ⋮ Recognising the Suzuki groups in their natural representations. ⋮ A computer-assisted analysis of some matrix groups. ⋮ The Ore conjecture. ⋮ Recognition of finite exceptional groups of Lie type ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ Constructive recognition of classical groups in odd characteristic. ⋮ Decomposing homogeneous modules of finite groups in characteristic zero. ⋮ First-Order Differential Power Analysis on the Duplication Method ⋮ CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS ⋮ The Alperin and Uno Conjectures for the Fischer Simple Group Fi22 ⋮ The Alperin Weight Conjecture and Dade's Conjecture for the Simple Group Fi′24 ⋮ Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field ⋮ A local strategy to decide the Alperin and Dade conjectures ⋮ Commutator maps, measure preservation, and 𝑇-systems ⋮ Minimal invariable generating sets ⋮ Expander graphs in pure and applied mathematics ⋮ Application of character estimates to the number of \(\mathrm{T}_2\)-systems of the alternating group ⋮ Limit Theorem for the Process of Additive Replacements ⋮ The average number of cycles. ⋮ THE ALPERIN AND DADE CONJECTURES FOR THE FISCHER SIMPLE GROUP Fi23 ⋮ Cutoff for product replacement on finite groups ⋮ Black box exceptional groups of Lie type ⋮ Unnamed Item ⋮ Maximal independent generating sets of the symmetric group ⋮ Recognising tensor-induced matrix groups. ⋮ Writing projective representations over subfields. ⋮ Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
Uses Software
Cites Work
