Recognising Tensor Products of Matrix Groups

DOI10.1142/S0218196797000241MaRDI QIDQ4399373zbMATH OpenOpenAlexFDO

Authors E. A. O'Brien, C. 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

algorithmscomplexitycomputational methodsgeneral linear groupsmatrix groups over finite fieldsmodular representationstensor decompositions

Mathematics Subject Classification ID

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

Recommendations

• Computing tensor decompositions of finite matrix groups
• Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
• The Tensor Product of Polynomials
• Computing matrix group decompositions with respect to a normal subgroup

Cited in

(19)

• 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
• Tensor factorizations of group algebras and modules
• Tensor isomorphism by conjugacy of Lie algebras
• Writing projective representations over subfields.
• Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
• Computing a chief series and the soluble radical of a matrix group over a finite field.
• On the tensor product of polynomials over a ring
• A practical model for computation with matrix groups.
• Conjugacy of Subgroups of the General Linear Group
• The Tensor Product of Polynomials
• Computing tensor decompositions of finite matrix groups
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Semilinear tensor decompositions
• Expansion for the product of matrices in groups
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.

This page was built for publication: Recognising Tensor Products of Matrix Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4399373)