AuthorHYETT, CRISTON MATTHEW
MetadataShow full item record
PublisherThe University of Arizona.
RightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
AbstractThe Meataxe algorithm is a popular algorithm to test modules for irreducibility. I review the theory and particular cases of the Meataxe algorithm and the analogies that can be drawn from normal forms of matrices. I describe my implementation of an algorithm already implemented in GAP (Groups, Algorithms, Programming) to compute the simple composition factors of a module, and implement changes that should in theory speed up computations with large modules. I then test and evaluate predictions.
Degree ProgramHonors College