Constructive recognition of classical groups in their natural representation.
The author gives a new algorithm to recognize constructively classical groups (SP, SU, \(\Omega^\varepsilon\)) in their natural representation. (See \textit{W. M. Kantor} and \textit{Γ. Seress} [Groups, combinatorics and geometry. Proceedings of the L.M.S. Durham symposium, Durham, UK, July 16-26, 2001. River Edge, NJ: World Scientific. 123-137 (2003; Zbl 1052.20001)] for a description of the context.) The algorithm is ``Las Vegas in that it uses random elements, but verifies the result to be correct. The heart of the construction is to find subgroups of type \(\Omega^+(4,q)\), respectively \(\text{Sp}(4,q)\) or \(\text{SU}(4,q)\), these then are used to span the whole group. A complete complexity analysis is given that shows the algorithm to perform notably better than the black-box algorithm of \textit{W. M. Kantor} and \textit{Γ. Seress} [Mem. Am. Math. Soc. 708, 168 p. (2001; Zbl 1053.20045)] and comparable with a similar algorithm for SL due to \textit{M. Conder} and \textit{C. R. Leedham-Green} [Groups and computation III. Proceedings of the international conference at the Ohio State University, Columbus, OH, USA, June 15-19, 1999. Berlin: Walter de Gruyter. Ohio State Univ. Math. Res. Inst. Publ. 8, 113-121 (2001; Zbl 1012.20043)]. Also concrete runtimes from the author's implementation are given.
- scientific article; zbMATH DE number 1004941
- Constructive recognition algorithms of classical groups in GAP
- Effective black-box constructive recognition of classical groups.
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Constructive recognition of classical groups in even characteristic.
- A constructive recognition algorithm for the matrix group (d,q).
- A Recognition Algorithm For Classical Groups Over Finite Fields
- A Recognition Algorithm for Special Linear Groups
- Black box classical groups.
- Fast recognition of classical groups over large fields
- Generating random elements of a finite group
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 1187223 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Recognising Tensor Products of Matrix Groups
- Testing matrix groups for primitivity
- The computational matrix group project.
- The Rank 3 Permutation Representations of the Finite Classical Groups
- Two-graphs and doubly transitive groups
- A new method for recognising Suzuki groups
- Algorithms in linear algebraic groups
- Presentations on standard generators for classical groups
- Constructive recognition of classical groups in even characteristic.
- Fast constructive recognition of black box orthogonal groups.
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
- Fast recognition of classical groups over large fields
- Constructive recognition algorithms of classical groups in GAP
- Recognition of finite exceptional groups of Lie type.
- Black box exceptional groups of Lie type.
- On intersections of classical groups
- CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
- Certain classical groups are not well-defined
- Recognising the small Ree groups in their natural representations.
- scientific article; zbMATH DE number 1004941 (Why is no real title available?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Intersecting two classical groups.
- On the twisted modules for finite matrix groups
- Effective black-box constructive recognition of classical groups.
- Black box exceptional groups of Lie type. II.
- Fast Constructive Recognition of Black-Box Unitary Groups
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- Constructive recognition of πππΏ(2,π)
- Constructive homomorphisms for classical groups.
- Constructive recognition of classical groups in odd characteristic.
- Fast constructive recognition of black box symplectic groups.
This page was built for publication: Constructive recognition of classical groups in their natural representation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426140)
