Recognising Tensor Products of Matrix Groups

DOI10.1142/S0218196797000241zbMath0907.20025OpenAlexW2093131847MaRDI QIDQ4399373

E. A. O'Brien, Charles R. Leedham-Green

Publication date: 7 March 1999

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196797000241

zbMATH Keywords

complexityalgorithmsgeneral linear groupscomputational methodsmodular representationstensor decompositionsmatrix groups over finite fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Representation theory for linear algebraic groups (20G05) Modular representations and characters (20C20)

Related Items

On the tensor product of polynomials over a ring ⋮ Prime power graphs for groups of Lie type ⋮ Tensor products are projective geometries ⋮ Conjugacy of Subgroups of the General Linear Group ⋮ Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced ⋮ Constructive recognition of classical groups in their natural representation. ⋮ A practical model for computation with matrix groups. ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ The Tensor Product of Polynomials ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field ⋮ Recognising tensor-induced matrix groups. ⋮ Writing projective representations over subfields. ⋮ Subgroups of \(\text{GL}_n(q)\) which fix sublattices of the subspace lattice