Testing modules for irreducibility

Abstract

AbstractA practical method is described for deciding whether or not a finite-dimensional module for a group over a finite field is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalistaion of the Parker-Norton ‘Meataxe’ algorithm, but it does not depend for its efficiency on the field being small. The principal tools involved are the calculation of the nullspace and the characteristic polynomial of a matrix over a finite field, and the factorisation of the latter. Related algorithms to determine absolute irreducibility and module isomorphism for irreducibles are also described. Details of an implementation in the GAP system, together with some performance analyses are included.