A polynomial-time reduction algorithm for groups of semilinear or subfield class.
DOI10.1016/J.JALGEBRA.2009.04.022zbMATH Open1219.20001OpenAlexW2056832206MaRDI QIDQ731236FDOQ731236
Authors: Max Neunhöffer, Colva M. Roney-Dougal, Jon F. Carlson 
Publication date: 2 October 2009
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2009.04.022
Recommendations
random elementsmatrix groupsmatrix group recognitionGAPAschbacher classificationAschbacher reductionprobabilistic Las Vegas algorithmssemilinear classsubfield class
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over fields (20H20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximal subgroups of the finite classical groups
- Fast Monte Carlo algorithms for permutation groups
- Writing projective representations over subfields.
- Generating random elements of a finite group
- Title not available (Why is that?)
- Title not available (Why is that?)
- Treating the Exceptional Cases of the MeatAxe
- The computational matrix group project.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Recognition Algorithm for Special Linear Groups
- Title not available (Why is that?)
- Writing representations over minimal fields
- Generating random elements in finite groups.
- A data structure for a uniform approach to computations with finite groups
- Testing matrix groups for primitivity
- Computing matrix group decompositions with respect to a normal subgroup
- Recognising Tensor Products of Matrix Groups
Cited In (7)
- A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
- A practical model for computation with matrix groups.
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules.
- Irreducibility testing of finite nilpotent linear groups.
- Writing projective representations over subfields.
- Determining Aschbacher classes using characters.
Uses Software
This page was built for publication: A polynomial-time reduction algorithm for groups of semilinear or subfield class.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731236)
