scientific article; zbMATH DE number 1004926

MaRDI QIDQ4335288zbMATH OpenFDO

Authors László Babai

Publication date 5 October 1997

zbMATH Keywords

matrix group recognition algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 96387
• Generating random elements of a finite group
• A random base change algorithm for permutation groups

Cited in

(12)

• Short presentations for finite groups
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• The product replacement algorithm and Kazhdan's property (T)
• Estimation problems and randomised group algorithms.
• Short presentations for alternating and symmetric groups
• THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Linear and sublinear time algorithms for the basis of abelian groups
• Constructive homomorphisms for classical groups.
• An algorithm for Lang's theorem.
• Computer construction of split Cartan subalgebras

This page was built for publication:

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