Algorithms for constructing KG-modules

Show simple item record

dc.contributor.advisor O'Brien, Eamonn
dc.contributor.advisor An, Jianbei
dc.contributor.author Goodwin, Simon
dc.date.accessioned 2022-09-09T01:09:26Z
dc.date.available 2022-09-09T01:09:26Z
dc.date.issued 2022 en
dc.identifier.uri https://hdl.handle.net/2292/61100
dc.description.abstract In this thesis, we present algorithms to study the submodule structure of a finite dimensional KG-module where G is a group and K is a finite field. The MeatAxe decides whether a given KG-module is reducible, and if so constructs a submodule. The submodule lattice algorithms construct all submodules of a KG-modules and the inclusions among those submodules. We report in detail the theory underpinning these algorithms. We have developed implementations of the algorithms in Magma and we report on their performance.
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof Masters Thesis - University of Auckland en
dc.relation.isreferencedby UoA en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/nz/
dc.title Algorithms for constructing KG-modules
dc.type Thesis en
thesis.degree.discipline Mathematics
thesis.degree.grantor The University of Auckland en
thesis.degree.level Masters en
dc.date.updated 2022-08-04T03:09:56Z
dc.rights.holder Copyright: the author en
dc.rights.accessrights http://purl.org/eprint/accessRights/OpenAccess en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics