Generating random elements of a finite group
From MaRDI portal
Publication:4857408
DOI10.1080/00927879508825509zbMath0836.20094MaRDI QIDQ4857408
Murray, Scott H., E. A. O'Brien, Alice C. Niemeyer, Charles R. Leedham-Green, F. Celler
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
68W30: Symbolic computation and algebraic computation
20F05: Generators, relations, and presentations of groups
20P05: Probabilistic methods in group theory
Related Items
THE ALPERIN AND DADE CONJECTURES FOR THE FISCHER SIMPLE GROUP Fi23, Right order spectral gap estimates for generating sets of ℤ4, CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS, A black-box group algorithm for recognizing finite symmetric and alternating groups, I, Product Replacement in the Monster, RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS, 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, Constructive recognition of 𝑃𝑆𝐿(2,𝑞), A note on computing involution centralizers., Irreducibility testing of finite nilpotent linear groups., Strong uniform expansion in \(\text{SL}(2,p)\)., Random generation of finite and profinite groups and group enumeration., The product replacement prospector., Orbit invariants and an application to the Baby Monster., 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., Fast constructive recognition of black box symplectic groups., Connectivity of the product replacement graph of simple groups of bounded Lie rank., The Ore conjecture., The average number of cycles., A local strategy to decide the Alperin and Dade conjectures, Prime power graphs for groups of Lie type, Constructive recognition of classical groups in their natural representation., Maximal independent generating sets of the symmetric group, Recognising tensor-induced matrix groups., Walks on generating sets of Abelian groups, Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture, Constructive recognition of classical groups in even characteristic., Constructive recognition of \(\text{SL}_3(q)\)., Recognising the Suzuki groups in their natural representations., A computer-assisted analysis of some matrix groups., Writing projective representations over subfields., Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules., The product replacement algorithm and Kazhdan’s property (T), Random matrix theory over finite fields, Black box exceptional groups of Lie type, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS, 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, Expander graphs in pure and applied mathematics, Commutator maps, measure preservation, and 𝑇-systems, A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model, Constructive membership in black-box groups, Connectivity of the product replacement algorithm graph of PSL(2, q)
Uses Software
Cites Work
