Constructive homomorphisms for classical groups.

DOI10.1016/J.JSC.2010.09.003zbMath1275.20055arXiv1009.1672OpenAlexW2032991824MaRDI QIDQ629346

Colva M. Roney-Dougal, Murray, Scott H.

Publication date: 9 March 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.1672

zbMATH Keywords

orthogonal groupspolynomial-time algorithmsspinor normquasisimple classical groupslinear groups over finite fieldsmatrix group recognitioncomputational group theorymatrix recognitionAschbacher theorem

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)

Related Items (5)

Algorithms in linear algebraic groups ⋮ Recognising the small Ree groups in their natural representations. ⋮ Constructive recognition of classical groups in even characteristic. ⋮ A practical model for computation with matrix groups. ⋮ A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup

Uses Software

• ConwayPol
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal subgroups of the finite classical groups
• Two-graphs and doubly transitive groups
• Constructive recognition of classical groups in their natural representation.
• Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
• Gaussian elimination is not optimal
• Computing in Unipotent and Reductive Algebraic Groups
• Constructing maximal subgroups of orthogonal groups
• Cyclic, separable and semisimple transformations in the finite conformal groups
• Conjugacy classes in projective and special linear groups
• Constructing Maximal Subgroups of Classical Groups

This page was built for publication: Constructive homomorphisms for classical groups.