scientific article; zbMATH DE number 1187237
From MaRDI portal
Publication:3840448
The Meataxe algorithm is known to be a practical algorithm for testing finite-dimensional modules over finite fields for irreducibility, and for finding explicit submodules in the reducible situation. The paper describes a version of the Meataxe for integral representations using \(p\)-adic methods. For the entire collection see [Zbl 0892.00032].
Recommendations
Cited in
(13)- Peakword condensation and submodule lattices: An application of the Meat- Axe
- The strong approximation theorem and computing with linear groups
- Trivializing a central simple algebra of degree 4 over the rational numbers.
- An algorithm for constructing representations of finite groups.
- Writing representations over proper division subrings.
- The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices
- Cyclic matrices and the MEATAXE
- Treating the Exceptional Cases of the MeatAxe
- Invariant bilinear forms on W-graph representations and linear algebra over integral domains
- Irreducibility testing of finite nilpotent linear groups.
- Is the projective cover of the trivial module in characteristic 11 for the sporadic simple Janko group J₄ a permutation module?
- Reprint of: ``Is the projective cover of the trivial module in characteristic \(11\) for the sporadic simple Janko group \(J_4\) a permutation module?
- Decomposing homogeneous modules of finite groups in characteristic zero.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840448)
