Constructing composition factors for a linear group in polynomial time
From MaRDI portal
Publication:2193255
DOI10.1016/j.jalgebra.2020.02.018zbMath1485.20123OpenAlexW3007393397MaRDI QIDQ2193255
E. A. O'Brien, Derek F. Holt, Charles R. Leedham-Green
Publication date: 25 August 2020
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/133847/1/WRAP-constructing-composition-factors-linear-polynomial-time-Holt-2020.pdf
Analysis of algorithms and problem complexity (68Q25) Linear algebraic groups over finite fields (20G40) Computational methods for problems pertaining to group theory (20-08)
Uses Software
Cites Work
- Recognising the small Ree groups in their natural representations.
- Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
- Effective black-box constructive recognition of classical groups.
- Black box exceptional groups of Lie type. II.
- A practical model for computation with matrix groups.
- Computing the composition factors of a permutation group in polynomial time
- On the maximal subgroups of the finite classical groups
- Sylow's theorem in polynomial time
- On the minimal degrees of projective representations of the finite Chevalley groups
- The Magma algebra system. I: The user language
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- A new method for recognising Suzuki groups
- Computing matrix group decompositions with respect to a normal subgroup
- Recognising tensor-induced matrix groups.
- Presentations on standard generators for classical groups
- Fast recognition of alternating groups of unknown degree.
- Recognising the Suzuki groups in their natural representations.
- Writing projective representations over subfields.
- Representations induced in an invariant subgroup
- Recognition of finite exceptional groups of Lie type
- Short presentations for alternating and symmetric groups
- On the Number ofp-Regular Elements in Finite Simple Groups
- Constructive membership in black-box groups
- The Finite Simple Groups
- Fast Management of Permutation Groups I
- Treating the Exceptional Cases of the MeatAxe
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- Computing in groups of Lie type
- Generating random elements of a finite group
- Polynomial-time theory of matrix groups
- Finding the characteristic of a group of Lie type
- Constructive recognition of ๐๐๐ฟ(2,๐)
- Factorizations of ๐โฟยฑ1, ๐=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing composition factors for a linear group in polynomial time
