Persistent Link:
http://hdl.handle.net/10150/614112
Title:
OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP
Author:
HYETT, CRISTON MATTHEW
Issue Date:
2016
Publisher:
The University of Arizona.
Rights:
Copyright © 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.
Abstract:
The 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.
Type:
text; Electronic Thesis
Degree Name:
B.S.
Degree Level:
Bachelors
Degree Program:
Honors College; Mathematics
Degree Grantor:
University of Arizona
Advisor:
Lux, Klaus

Full metadata record

DC FieldValue Language
dc.language.isoen_USen
dc.titleOPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAPen_US
dc.creatorHYETT, CRISTON MATTHEWen
dc.contributor.authorHYETT, CRISTON MATTHEWen
dc.date.issued2016-
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.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.en
dc.typetexten
dc.typeElectronic Thesisen
thesis.degree.nameB.S.en
thesis.degree.levelBachelorsen
thesis.degree.disciplineHonors Collegeen
thesis.degree.disciplineMathematicsen
thesis.degree.grantorUniversity of Arizonaen
dc.contributor.advisorLux, Klausen
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.