Fast constructive recognition of black box symplectic groups.

DOI10.1016/J.JALGEBRA.2008.03.021MaRDI QIDQ947501zbMATH OpenOpenAlexFDO

Authors 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

constructive recognitionLas Vegas algorithmsfinite symplectic groupsblack box groupsGAP

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Representations of finite groups of Lie type (20C33)

Recommendations

• On constructive recognition of a black box \(\text{PSL}(d,q)\).
• Fast constructive recognition of black box orthogonal groups.
• Effective black-box constructive recognition of classical groups.
• Constructive recognition of classical groups in their natural representation.
• Probabilistic recognition of orthogonal and symplectic groups

Cites work

• Black box classical groups.
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Computing maximal subgroups of finite groups.
• Constructive membership in black-box groups
• Constructive recognition of classical groups in their natural representation.
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Fast Constructive Recognition of Black-Box Unitary Groups
• Fast constructive recognition of black box orthogonal groups.
• Fast recognition of classical groups over large fields
• Generating random elements of a finite group
• On constructive recognition of a black box \(\text{PSL}(d,q)\).
• The Magma algebra system. I: The user language
• The Rank 3 Permutation Representations of the Finite Classical Groups
• Towards effective algorithms for linear groups.
• Two-graphs and doubly transitive groups

Cited in

(12)

• Black box exceptional groups of Lie type. II.
• Effective black-box constructive recognition of classical groups.
• Constructive recognition of classical groups in even characteristic.
• On constructive recognition of a black box \(\text{PSL}(d,q)\).
• A practical model for computation with matrix groups.
• Probabilistic recognition of orthogonal and symplectic groups
• Recognition of finite exceptional groups of Lie type.
• Fast constructive recognition of black box orthogonal groups.
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
• Black box exceptional groups of Lie type.
• Fast Constructive Recognition of Black-Box Unitary Groups

Describes a project that uses

Uses Software

• GAP
• Magma

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

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