We are upgrading the repository! A content freeze is in effect until December 6th, 2024 - no new submissions will be accepted; however, all content already published will remain publicly available. Please reach out to repository@u.library.arizona.edu with your questions, or if you are a UA affiliate who needs to make content available soon. Note that any new user accounts created after September 22, 2024 will need to be recreated by the user in November after our migration is completed.
Computational Group Theory
| dc.contributor.advisor | Lux, Klaus | en |
| dc.contributor.author | Martin, Michael Patrick McAlarnen | |
| dc.creator | Martin, Michael Patrick McAlarnen | en |
| dc.date.accessioned | 2015-10-05T22:18:46Z | en |
| dc.date.available | 2015-10-05T22:18:46Z | en |
| dc.date.issued | 2015 | en |
| dc.identifier.citation | Martin, Michael Patrick McAlarnen. (2015). Computational Group Theory (Bachelor's thesis, University of Arizona, Tucson, USA). | |
| dc.identifier.uri | http://hdl.handle.net/10150/579297 | en |
| dc.description.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. | |
| 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 | Computational Group Theory | 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-08-14T21:35:03Z | |
| html.description.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. |
