Computing matrix group decompositions with respect to a normal subgroup
From MaRDI portal
Publication:1815004
DOI10.1006/jabr.1996.0286zbMath0865.20014OpenAlexW1969338131MaRDI QIDQ1815004
E. A. O'Brien, Sarah Rees, Derek F. Holt, Charles R. Leedham-Green
Publication date: 14 July 1997
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jabr.1996.0286
tensor productswreath productsdecompositionsfinite matrix groupscomputer recognitiondirect sums of subspacesSMASH
Related Items
Comparing the order and the minimal number of generators of a finite irreducible linear group ⋮ Prime power graphs for groups of Lie type ⋮ Tensor products are projective geometries ⋮ The Solvable Primitive Permutation Groups of Degree at Most 6560 ⋮ Conjugacy of Subgroups of the General Linear Group ⋮ Constructing composition factors for a linear group in polynomial time ⋮ The affine primitive permutation groups of degree less than 1000. ⋮ A practical model for computation with matrix groups. ⋮ Constructive Sylow theorems for the classical groups. ⋮ A computer-assisted analysis of some matrix groups. ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS ⋮ Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field ⋮ Algorithms for matrix groups and the Tits alternative ⋮ Writing projective representations over subfields. ⋮ Computing in Nilpotent Matrix Groups
Uses Software