RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS

DOI10.1017/S144678870800092XzbMath1216.20005OpenAlexW2073295921MaRDI QIDQ5322917

E. A. O'Brien, Seress, Ákos, Kay Magaard

Publication date: 23 July 2009

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s144678870800092x

zbMATH Keywords

symmetric squaresprojective representationsfinite general linear groupsefficient algorithmsmatrix group recognitioncomputational group theoryalternating square adjoint representationLas Vegas polynomial-time algorithms

Mathematics Subject Classification ID

Related Items (5)

Constructive recognition of classical groups in even characteristic. ⋮ Effective black-box constructive recognition of classical groups. ⋮ A practical model for computation with matrix groups. ⋮ On the twisted modules for finite matrix groups ⋮ ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS

Cites Work

• Identification of matrix generators of a Chevalley group.
• Fast algorithms for the characteristic polynomial
• The Magma algebra system. I: The user language
• Constructive recognition of classical groups in their natural representation.
• Writing projective representations over subfields.
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
• On the Orders of Maximal Subgroups of the Finite Classical Groups
• A Recognition Algorithm for Special Linear Groups
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Generating random elements of a finite group

This page was built for publication: RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS