Show simple item record

dc.contributor.advisorLux, Klausen
dc.contributor.authorHYETT, CRISTON MATTHEW
dc.creatorHYETT, CRISTON MATTHEWen
dc.date.accessioned2016-06-22T16:49:36Z
dc.date.available2016-06-22T16:49:36Z
dc.date.issued2016
dc.identifier.citationHYETT, CRISTON MATTHEW. (2016). OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP (Bachelor's thesis, University of Arizona, Tucson, USA).
dc.identifier.urihttp://hdl.handle.net/10150/614112
dc.description.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.
dc.language.isoen_USen
dc.publisherThe University of Arizona.en
dc.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.en
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.titleOPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAPen_US
dc.typetexten
dc.typeElectronic Thesisen
thesis.degree.grantorUniversity of Arizonaen
thesis.degree.levelBachelorsen
thesis.degree.disciplineHonors Collegeen
thesis.degree.disciplineMathematicsen
thesis.degree.nameB.S.en
refterms.dateFOA2018-09-11T13:41:49Z
html.description.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.


Files in this item

Thumbnail
Name:
azu_etd_mr_2016_0110_sip1_m.pdf
Size:
249.6Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record