The aim of this thesis is to generate original symmetric presentations for finite non-abelian simple groups. We will discuss many permutation progenitors, including but not limited to 2*14 : D28, 2∗9 : 3•(32), 3∗9 : 3•(32), 2∗21 : (7X3) : 2 as well as monomial progenitors, including 7∗5 :m A5, 3∗5 :m S5. We have included their homomorphic images which include the Mathieu group M12, 2•J2, 2XS(4, 5), as well as, many PGL′s, PSL′s and alternating groups. We will give proofs of the isomorphism types of each progenitor, either by hand using double coset enumeration or computer based using MAGMA. We have also constructed Cayley graphs of the following groups, 25 : S5 over 2∗5 : S5, PSL(2, 8) over 2∗7 : D14, M12 over a maximal subgroup, 2XS5. We have developed a lemma using relations to factor permutation progenitors of the form m∗n : N to give an isomorphism of mn : N . Motivated by Robert T. Curtis’ research, we will present a program using MAGMA that, when given a target finite non-abelian simple group, the program will generate possible control groups to write progenitors that will give the given finite non-abelian simple group. Iwasawa’s lemma is also discussed and used to prove PSL(2, 8) and M12 to be simple groups.
| Identifer | oai:union.ndltd.org:csusb.edu/oai:scholarworks.lib.csusb.edu:etd-1202 |
| Date | 01 June 2015 |
| Creators | Grindstaff, Dustin J |
| Publisher | CSUSB ScholarWorks |
| Source Sets | California State University San Bernardino |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Electronic Theses, Projects, and Dissertations |
Page generated in 0.0017 seconds