An algorithm for determining the simplicity of a modular group representation

DOI10.1016/S0747-7171(88)80025-7zbMath0656.20014MaRDI QIDQ1109882

Gerhard O. Michler

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

group algebrasimple modulespolynomial identitiesfinite groupsplitting fieldfaithful representationstandard polynomialsimple FG-submodules

Mathematics Subject Classification ID

Group rings (16S34) Modular representations and characters (20C20) Group rings of finite groups and their modules (group-theoretic aspects) (20C05) Software, source code, etc. for problems pertaining to group theory (20-04) Rings with polynomial identity (16Rxx)

Related Items (1)

Testing modules of groups of even order for simplicity

Cites Work

• The modular characters of the Mathieu groups
• Common eigenvectors of two matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for determining the simplicity of a modular group representation