Constructive recognition of classical groups in their natural representation.

DOI10.1016/S0747-7171(02)00132-3zbMath1054.20001MaRDI QIDQ1426140

Peter A. Brooksbank

Publication date: 14 March 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

matrix groupssimple groupsconstructive recognitionLas Vegas algorithms

Mathematics Subject Classification ID

Related Items (15)

Gaussian elimination in unitary groups with an application to cryptography ⋮ Fast Constructive Recognition of Black-Box Unitary Groups ⋮ RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS ⋮ Algorithms in linear algebraic groups ⋮ Constructive homomorphisms for classical groups. ⋮ On intersections of classical groups ⋮ Constructive recognition of classical groups in even characteristic. ⋮ Black box exceptional groups of Lie type. II. ⋮ On the twisted modules for finite matrix groups ⋮ Fast constructive recognition of black box symplectic groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Fast constructive recognition of black box orthogonal groups. ⋮ Recognition of finite exceptional groups of Lie type ⋮ Constructive recognition of classical groups in odd characteristic. ⋮ Black box exceptional groups of Lie type

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-graphs and doubly transitive groups
• Testing matrix groups for primitivity
• Black box classical groups
• 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
• Recognising Tensor Products of Matrix Groups
• Generating random elements of a finite group

This page was built for publication: Constructive recognition of classical groups in their natural representation.