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

DOI10.1016/j.jalgebra.2009.04.022zbMath1219.20001OpenAlexW2056832206MaRDI QIDQ731236

Colva M. Roney-Dougal, Max Neunhöffer, Carlson, Jon F.

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

matrix groupsrandom elementsGAPmatrix group recognitionAschbacher 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)

Related Items

A practical model for computation with matrix groups. ⋮ A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup ⋮ DETERMINING ASCHBACHER CLASSES USING CHARACTERS

Uses Software

• GAP
• MeatAxe
• recog

Cites Work

• On the maximal subgroups of the finite classical groups
• Generating random elements in finite groups.
• Testing matrix groups for primitivity
• Computing matrix group decompositions with respect to a normal subgroup
• Fast Monte Carlo algorithms for permutation groups
• Writing projective representations over subfields.
• A data structure for a uniform approach to computations with finite groups
• A Recognition Algorithm for Special Linear Groups
• Writing representations over minimal fields
• Recognising Tensor Products of Matrix Groups
• Treating the Exceptional Cases of the MeatAxe
• Generating random elements of a finite group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item