OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP
dc.contributor.advisor | Lux, Klaus | en |
dc.contributor.author | HYETT, CRISTON MATTHEW | |
dc.creator | HYETT, CRISTON MATTHEW | en |
dc.date.accessioned | 2016-06-22T16:49:36Z | |
dc.date.available | 2016-06-22T16:49:36Z | |
dc.date.issued | 2016 | |
dc.identifier.citation | HYETT, CRISTON MATTHEW. (2016). OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP (Bachelor's thesis, University of Arizona, Tucson, USA). | |
dc.identifier.uri | http://hdl.handle.net/10150/614112 | |
dc.description.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. | |
dc.language.iso | en_US | en |
dc.publisher | The University of Arizona. | en |
dc.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. | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.title | OPTIMIZATIONS OF CHOP: AN EXTENDED MEATAXE ALGORITHM IN GAP | en_US |
dc.type | text | en |
dc.type | Electronic Thesis | en |
thesis.degree.grantor | University of Arizona | en |
thesis.degree.level | Bachelors | en |
thesis.degree.discipline | Honors College | en |
thesis.degree.discipline | Mathematics | en |
thesis.degree.name | B.S. | en |
refterms.dateFOA | 2018-09-11T13:41:49Z | |
html.description.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. |