Back to results

CSUniversity San Bernardino

Symmetric Presentations and Generation

Abstract

dc:description.abstract

<p>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<sup>*14</sup> : <em>D</em><sub>28</sub>, 2<sup><em>∗</em>9</sup> : 3<sup><em>•</em></sup>(3<sup>2</sup>), 3<sup><em>∗</em>9</sup> : 3<sup><em>•</em></sup>(3<sup>2</sup>), 2<sup><em>∗</em>21</sup> : (7<em>X</em>3) : 2 as well as monomial progenitors, including 7<sup><em>∗</em>5</sup> :<sub><em>m </em></sub><em>A</em><sub>5</sub>, 3<sup><em>∗</em>5</sup> :<em><sub>m</sub> </em><em>S</em><sub>5</sub>. We have included their homomorphic images which include the Mathieu group <em>M</em><sub>12</sub>, 2<sup><em>•</em></sup><em>J</em><sub>2</sub>, 2<em>X</em><em>S</em>(4<em>,</em><em> </em>5), as well as, many <em>P</em><em>GL</em><em>′</em><em>s</em>, <em>P</em><em>S</em><em>L</em><em>′</em><em>s </em>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, 2<sup>5</sup> : <em>S</em><sub>5</sub> over 2<sup><em>∗</em>5</sup> : <em>S</em><sub>5</sub>, <em>P</em><em>S</em><em>L</em>(2<em>, </em>8) over 2<sup><em>∗</em>7</sup> : <em>D</em><sub>14</sub>, <em>M</em><sub>12 </sub>over a maximal subgroup, 2<em>X</em><em>S</em><sub>5</sub>. We have developed a lemma using relations to factor permutation progenitors of the form <em>m</em><sup><em>∗</em></sup><em>n</em><em> </em>: <em>N </em>to give an isomorphism of <em>m</em><sup><em>n</em></sup><em> </em>: <em>N </em>. 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 <em>P</em><em>S</em><em>L</em>(2<em>, </em>8) and <em>M</em><sub>12</sub> to be simple groups.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Arts in Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics
Year dc:date.available
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Grindstaff, Dustin J
Contributors dc:contributor
  • Hasan, Zahid

Subjects

dc:subject × 7

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd/202
OAI identifier oai:identifier
oai:scholarworks.lib.csusb.edu:etd-1202

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Grindstaff, Dustin J. Symmetric Presentations and Generation. Thesis thesis, 2015. https://scholarworks.lib.csusb.edu/etd/202