Constructing composition factors for a linear group in polynomial time
From MaRDI portal
Publication:2193255
Recommendations
- Computing the composition factors of a permutation group in polynomial time
- scientific article; zbMATH DE number 1004928
- Bounding the even abelian composition factors in finite linear groups
- scientific article; zbMATH DE number 2151233
- scientific article; zbMATH DE number 1263311
- scientific article; zbMATH DE number 7559413
- On the odd order composition factors of finite linear groups
- Polynomial-time theory of matrix groups
- Methods for constructing factorizations of abelian groups with applications
- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1284153 (Why is no real title available?)
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- scientific article; zbMATH DE number 1004929 (Why is no real title available?)
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- A new method for recognising Suzuki groups
- A practical model for computation with matrix groups.
- Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
- Black box exceptional groups of Lie type. II.
- Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- Computing in groups of Lie type
- Computing matrix group decompositions with respect to a normal subgroup
- Computing the composition factors of a permutation group in polynomial time
- Constructive membership in black-box groups
- Constructive recognition of ๐๐๐ฟ(2,๐)
- Effective black-box constructive recognition of classical groups.
- Factorizations of ๐โฟยฑ1, ๐=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Fast Management of Permutation Groups I
- Fast recognition of alternating groups of unknown degree.
- Finding the characteristic of a group of Lie type
- Generating random elements of a finite group
- On the maximal subgroups of the finite classical groups
- On the minimal degrees of projective representations of the finite Chevalley groups
- On the number of \(p\)-regular elements in finite simple groups.
- Polynomial-time theory of matrix groups
- Presentations on standard generators for classical groups
- Recognising tensor-induced matrix groups.
- Recognising the Suzuki groups in their natural representations.
- Recognising the small Ree groups in their natural representations.
- Recognition of finite exceptional groups of Lie type.
- Recognizing simplicity of black-box groups and the frequency of \(p\)-singular elements in affine groups.
- Representations induced in an invariant subgroup
- Short presentations for alternating and symmetric groups
- Sylow's theorem in polynomial time
- The Finite Simple Groups
- The Magma algebra system. I: The user language
- Treating the Exceptional Cases of the MeatAxe
- Writing projective representations over subfields.
This page was built for publication: Constructing composition factors for a linear group in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193255)
