A polynomial-time reduction algorithm for groups of semilinear or subfield class.

DOI10.1016/J.JALGEBRA.2009.04.022MaRDI QIDQ731236zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

random elementsmatrix groupsmatrix group recognitionGAPAschbacher classificationAschbacher reductionprobabilistic Las Vegas algorithmssemilinear classsubfield class

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 5043412
• A Recognition Algorithm for Special Linear Groups
• scientific article; zbMATH DE number 1981751
• A Recognition Algorithm For Classical Groups Over Finite Fields
• scientific article; zbMATH DE number 1004928

Cites work

• scientific article; zbMATH DE number 3884354 (Why is no real title available?)
• scientific article; zbMATH DE number 3136688 (Why is no real title available?)
• scientific article; zbMATH DE number 3736029 (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 1836318 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• A Recognition Algorithm for Special Linear Groups
• A data structure for a uniform approach to computations with finite groups
• Computing matrix group decompositions with respect to a normal subgroup
• Fast Monte Carlo algorithms for permutation groups
• Generating random elements in finite groups.
• Generating random elements of a finite group
• On the maximal subgroups of the finite classical groups
• Recognising Tensor Products of Matrix Groups
• Testing matrix groups for primitivity
• The computational matrix group project.
• Treating the Exceptional Cases of the MeatAxe
• Writing projective representations over subfields.
• Writing representations over minimal fields

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.

Describes a project that uses

Uses Software

• recog
• MeatAxe
• GAP

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)