Fast constructive recognition of black box orthogonal groups.

DOI10.1016/j.jalgebra.2006.02.024zbMath1107.20013OpenAlexW2054841133MaRDI QIDQ2496866

Peter A. Brooksbank, William M. Kantor

Publication date: 20 July 2006

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2006.02.024

zbMATH Keywords

orthogonal groupspolynomial time algorithmsconstructive recognitionblack box groupsdiscrete logarithms

Mathematics Subject Classification ID

Related Items (10)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-graphs and doubly transitive groups
• Prime power graphs for groups of Lie type
• Short presentations for finite groups
• Constructive recognition of classical groups in their natural representation.
• Black box classical groups
• A Recognition Algorithm for Special Linear Groups
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Fast Constructive Recognition of Black-Box Unitary Groups
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)

This page was built for publication: Fast constructive recognition of black box orthogonal groups.