{"id":{"repo_id":"csusb","oai_identifier":"oai:scholarworks.lib.csusb.edu:etd-1202"},"canonical_url":"https://search.dev.ndltd.org/etd/csusb/oai:scholarworks.lib.csusb.edu:etd-1202","repository":{"repo_id":"csusb","name":"CSUniversity San Bernardino","base_url":"https://scholarworks.lib.csusb.edu/do/oai/"},"display":{"title":"Symmetric Presentations and Generation","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>","abstract_html":"&lt;p&gt;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&lt;sup&gt;*14&lt;/sup&gt; : &lt;em&gt;D&lt;/em&gt;&lt;sub&gt;28&lt;/sub&gt;, 2&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;9&lt;/sup&gt; : 3&lt;sup&gt;&lt;em&gt;•&lt;/em&gt;&lt;/sup&gt;(3&lt;sup&gt;2&lt;/sup&gt;), 3&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;9&lt;/sup&gt; : 3&lt;sup&gt;&lt;em&gt;•&lt;/em&gt;&lt;/sup&gt;(3&lt;sup&gt;2&lt;/sup&gt;), 2&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;21&lt;/sup&gt; : (7&lt;em&gt;X&lt;/em&gt;3) : 2 as well as monomial progenitors, including 7&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;5&lt;/sup&gt; :&lt;sub&gt;&lt;em&gt;m &lt;/em&gt;&lt;/sub&gt;&lt;em&gt;A&lt;/em&gt;&lt;sub&gt;5&lt;/sub&gt;, 3&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;5&lt;/sup&gt; :&lt;em&gt;&lt;sub&gt;m&lt;/sub&gt; &lt;/em&gt;&lt;em&gt;S&lt;/em&gt;&lt;sub&gt;5&lt;/sub&gt;. We have included their homomorphic images which include the Mathieu group &lt;em&gt;M&lt;/em&gt;&lt;sub&gt;12&lt;/sub&gt;, 2&lt;sup&gt;&lt;em&gt;•&lt;/em&gt;&lt;/sup&gt;&lt;em&gt;J&lt;/em&gt;&lt;sub&gt;2&lt;/sub&gt;, 2&lt;em&gt;X&lt;/em&gt;&lt;em&gt;S&lt;/em&gt;(4&lt;em&gt;,&lt;/em&gt;&lt;em&gt; &lt;/em&gt;5), as well as, many &lt;em&gt;P&lt;/em&gt;&lt;em&gt;GL&lt;/em&gt;&lt;em&gt;′&lt;/em&gt;&lt;em&gt;s&lt;/em&gt;, &lt;em&gt;P&lt;/em&gt;&lt;em&gt;S&lt;/em&gt;&lt;em&gt;L&lt;/em&gt;&lt;em&gt;′&lt;/em&gt;&lt;em&gt;s &lt;/em&gt;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&lt;sup&gt;5&lt;/sup&gt; : &lt;em&gt;S&lt;/em&gt;&lt;sub&gt;5&lt;/sub&gt; over 2&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;5&lt;/sup&gt; : &lt;em&gt;S&lt;/em&gt;&lt;sub&gt;5&lt;/sub&gt;, &lt;em&gt;P&lt;/em&gt;&lt;em&gt;S&lt;/em&gt;&lt;em&gt;L&lt;/em&gt;(2&lt;em&gt;, &lt;/em&gt;8) over 2&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;7&lt;/sup&gt; : &lt;em&gt;D&lt;/em&gt;&lt;sub&gt;14&lt;/sub&gt;, &lt;em&gt;M&lt;/em&gt;&lt;sub&gt;12 &lt;/sub&gt;over a maximal subgroup, 2&lt;em&gt;X&lt;/em&gt;&lt;em&gt;S&lt;/em&gt;&lt;sub&gt;5&lt;/sub&gt;. We have developed a lemma using relations to factor permutation progenitors of the form &lt;em&gt;m&lt;/em&gt;&lt;sup&gt;&lt;em&gt;∗&lt;/em&gt;&lt;/sup&gt;&lt;em&gt;n&lt;/em&gt;&lt;em&gt; &lt;/em&gt;: &lt;em&gt;N &lt;/em&gt;to give an isomorphism of &lt;em&gt;m&lt;/em&gt;&lt;sup&gt;&lt;em&gt;n&lt;/em&gt;&lt;/sup&gt;&lt;em&gt; &lt;/em&gt;: &lt;em&gt;N &lt;/em&gt;. 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 &lt;em&gt;P&lt;/em&gt;&lt;em&gt;S&lt;/em&gt;&lt;em&gt;L&lt;/em&gt;(2&lt;em&gt;, &lt;/em&gt;8) and &lt;em&gt;M&lt;/em&gt;&lt;sub&gt;12&lt;/sub&gt; to be simple groups.&lt;/p&gt;","abstract_has_math":false,"creators":["Grindstaff, Dustin J"],"institution":null,"degree_name":"Master of Arts in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":["Hasan, Zahid"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-06-01T07:00:00Z","date_published":"2015-06-01T07:00:00Z","updated_at":"2026-07-24T01:52:45Z","subjects":["symmetric presentation","simple group","progenitor","MAGMA","double coset enumeration","homomorphic image","Algebra"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://scholarworks.lib.csusb.edu/etd/202","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hasan, Zahid"]},{"key":"dc:creator","label":"Author","values":["Grindstaff, Dustin J"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-05-20T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["symmetric presentation","simple group","progenitor","MAGMA","double coset enumeration","homomorphic image","Algebra"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholarworks.lib.csusb.edu/etd/202"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:title","label":"Title","values":["Symmetric Presentations and Generation"]}]}],"canonical_facts":{"dc:contributor":["Hasan, Zahid"],"dc:creator":["Grindstaff, Dustin J"],"dc:date.available":["2015-05-20T07:00:00Z"],"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>"],"dc:identifier":["https://scholarworks.lib.csusb.edu/etd/202"],"dc:subject":["symmetric presentation","simple group","progenitor","MAGMA","double coset enumeration","homomorphic image","Algebra"],"dc:title":["Symmetric Presentations and Generation"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Arts in Mathematics"]},"updated_at":"2026-07-24T01:52:45Z"}