Recognising Tensor Products of Matrix Groups

DOI10.1142/S0218196797000241zbMath0907.20025MaRDI 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)

zbMATH Keywords

complexity; algorithms; general linear groups; computational methods; modular representations; tensor decompositions; matrix groups over finite fields

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20G40: Linear algebraic groups over finite fields

20G05: Representation theory for linear algebraic groups

20C20: Modular representations and characters

Related Items

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