Persistent Link:
http://hdl.handle.net/10150/579297
Title:
Computational Group Theory
Author:
Martin, Michael Patrick McAlarnen
Issue Date:
2015
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 study of finite groups has been the subject of much research, with substantial success in the 20th century, in part due to the development of representation theory. Representation theory allows groups to be studied using the well-understood properties of linear algebra, however it requires the researcher to supply a representation of the group. One way to produce representations of groups is to take a representation of a subgroup and use it to induce a representation. We focus on the finite simple groups because they are the buliding blocks of an arbitrary simple group. This thesis investigates an algorithm to induce representations of large finite simple groups from a representation of a subgroup.
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.titleComputational Group Theoryen_US
dc.creatorMartin, Michael Patrick McAlarnenen
dc.contributor.authorMartin, Michael Patrick McAlarnenen
dc.date.issued2015en
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 study of finite groups has been the subject of much research, with substantial success in the 20th century, in part due to the development of representation theory. Representation theory allows groups to be studied using the well-understood properties of linear algebra, however it requires the researcher to supply a representation of the group. One way to produce representations of groups is to take a representation of a subgroup and use it to induce a representation. We focus on the finite simple groups because they are the buliding blocks of an arbitrary simple group. This thesis investigates an algorithm to induce representations of large finite simple groups from a representation of a subgroup.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.