Constructing Maximal Subgroups of Classical Groups
DOI10.1112/S1461157000000899zbMath1079.20021OpenAlexW2028827359MaRDI QIDQ5697468
Derek F. Holt, Colva M. Roney-Dougal
Publication date: 17 October 2005
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.lms.ac.uk/jcm/8/lms2004-008/
symplectic groupsmaximal subgroupsunitary groupspolynomial time algorithmsfinite classical groupslinear groupsAschbacher classesabsolutely irreducible groups
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Maximal subgroups (20E28) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: alternating groups and groups of Lie type (20D06)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximal subgroups of the finite classical groups
- A classification of the maximal subgroups of the finite alternating and symmetric groups
- Gaussian elimination is not optimal
- Low-Dimensional Representations of Quasi-Simple Groups
- The primitive permutation groups of degree less than 1000
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- Small Degree Representations of Finite Chevalley Groups in Defining Characteristic
- Conjugacy of Subgroups of the General Linear Group
This page was built for publication: Constructing Maximal Subgroups of Classical Groups