Fast constructive recognition of black box symplectic groups.

DOI10.1016/j.jalgebra.2008.03.021zbMath1158.20022MaRDI QIDQ947501

Peter A. Brooksbank

Publication date: 6 October 2008

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

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

zbMATH Keywords

finite symplectic groups; GAP; 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

20C33: Representations of finite groups of Lie type

Related Items

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 even characteristic., Recognition of finite exceptional groups of Lie type, Black box exceptional groups of Lie type

Uses Software

• GAP
• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-graphs and doubly transitive groups
• The Magma algebra system. I: The user language
• Constructive recognition of classical groups in their natural representation.
• Fast constructive recognition of black box orthogonal groups.
• Computing maximal subgroups of finite groups.
• Black box classical groups
• Constructive membership in black-box groups
• The Rank 3 Permutation Representations of the Finite Classical Groups
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Fast Constructive Recognition of Black-Box Unitary Groups
• Generating random elements of a finite group
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)