Fast Constructive Recognition of Black-Box Unitary Groups

DOI10.1112/S1461157000000437MaRDI QIDQ4827614zbMATH OpenOpenAlexFDO

Authors 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 groupsconstructive recognitionLas Vegas algorithmsblack box groups

Mathematics Subject Classification ID

Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• Fast constructive recognition of black box orthogonal groups.
• Effective black-box constructive recognition of classical groups.
• Fast constructive recognition of black box symplectic groups.
• Fast recognition of alternating groups of unknown degree.
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Constructive membership testing in black-box classical groups.
• New approaches in black box group theory.
• Fast recognition of classical groups over large fields
• scientific article; zbMATH DE number 1004932
• Black-box recognition of finite simple groups of Lie type by statistics of element orders

Cites work

• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• A Recognition Algorithm For Classical Groups Over Finite Fields
• A Recognition Algorithm for Special Linear Groups
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Constructive recognition of classical groups in their natural representation.
• On the maximal subgroups of the finite classical groups
• The Rank 3 Permutation Representations of the Finite Classical Groups

Cited in

(11)

• 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.
• Constructive recognition of classical groups in odd characteristic.
• A practical model for computation with matrix groups.
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• Black box exceptional groups of Lie type. II.
• Effective black-box constructive recognition of classical groups.
• Fast constructive recognition of black box symplectic groups.
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)

This page was built for publication: Fast Constructive Recognition of Black-Box Unitary Groups

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