Fast Constructive Recognition of Black-Box Unitary Groups

DOI10.1112/S1461157000000437zbMath1053.20044MaRDI QIDQ4827614

Peter A. Brooksbank

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/6/lms2003-008/

zbMATH Keywords

finite linear groups; constructive recognition; Las Vegas algorithms; black box groups

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20G40: Linear algebraic groups over finite fields

20-04: Software, source code, etc. for problems pertaining to group theory

68W20: Randomized algorithms

20P05: Probabilistic methods in group theory

Related Items

Gaussian elimination in unitary groups with an application to cryptography, Effective black-box constructive recognition of classical groups., Black box exceptional groups of Lie type. II., A practical model for computation with matrix groups., Constructive recognition of classical groups in odd characteristic., Fast constructive recognition of black box symplectic groups., Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\), Constructive recognition of classical groups in even characteristic., Fast constructive recognition of black box orthogonal groups., Recognition of finite exceptional groups of Lie type, Black box exceptional groups of Lie type

Cites Work

• Unnamed Item
• On the maximal subgroups of the finite classical groups
• Constructive recognition of classical groups in their natural representation.
• The Rank 3 Permutation Representations of the Finite Classical Groups
• A Recognition Algorithm for Special Linear Groups
• A Recognition Algorithm For Classical Groups Over Finite Fields
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I