Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T13:55:54.173Z Has data issue: false hasContentIssue false

Testing modules for irreducibility

Published online by Cambridge University Press:  09 April 2009

Derek F. Holt
Affiliation:
Mathematics Institute, University of Warwick, Coventry CV4 7AL, Great Britian, e-mail: dfh@maths.warwick.ac.uk
Sarah Rees
Affiliation:
Department of Mathematics and Statistics, University of Newcastle, Newscastle-upon-Tyne NE1 7RU, Great Britian, e-mail: sarah.rees@newcastle.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A 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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1994