Fast constructive recognition of black box symplectic groups.
From MaRDI portal
Publication:947501
DOI10.1016/J.JALGEBRA.2008.03.021zbMATH Open1158.20022OpenAlexW2053166670MaRDI QIDQ947501FDOQ947501
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
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
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Representations of finite groups of Lie type (20C33)
Cites Work
- The Magma algebra system. I: The user language
- The Rank 3 Permutation Representations of the Finite Classical Groups
- Generating random elements of a finite group
- Constructive membership in black-box groups
- Constructive recognition of ๐๐๐ฟ(2,๐)
- Two-graphs and doubly transitive groups
- Constructive recognition of classical groups in their natural representation.
- Fast constructive recognition of black box orthogonal groups.
- Black box classical groups.
- On constructive recognition of a black box \(\text{PSL}(d,q)\).
- Fast recognition of classical groups over large fields
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- Fast Constructive Recognition of Black-Box Unitary Groups
- Towards effective algorithms for linear groups.
- Computing maximal subgroups of finite groups.
Cited In (12)
- Constructive recognition of classical groups in even characteristic.
- Fast constructive recognition of black box orthogonal groups.
- On constructive recognition of a black box \(\text{PSL}(d,q)\).
- Recognition of finite exceptional groups of Lie type.
- Black box exceptional groups of Lie type.
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- A practical model for computation with matrix groups.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Probabilistic recognition of orthogonal and symplectic groups
- Black box exceptional groups of Lie type. II.
- Effective black-box constructive recognition of classical groups.
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
Uses Software
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)
