AN ENHANCEMENT TO CHOP
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
CHOP is a package by Max Neunh¨offer and Felix Noeske in computational group theory implemented in the computeralgebra system GAP.ThemainalgorithminCHOP, which wealso will call CHOP, finds all of the irreducible modules of a given module of an algebra and is the central focus of this paper. First, the theory behind the algorithm and why it works is explained. Then a potential improvement to the algorithm for special cases is suggested. This improvement is explored numerically and the degree to which it was successful is discussed.Type
Electronic thesistext
Degree Name
B.S.Degree Level
bachelorsDegree Program
MathematicsHonors College