In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis.
","abstract_html":"<p>In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis.</p>","abstract_has_math":false,"creators":["Frenk, Anthony"],"institution":null,"degree_name":"Master of Science (MS) in Mathematics","degree_level":"Thesis","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-01-01T08:00:00Z","date_published":"2013-01-01T08:00:00Z","updated_at":"2026-07-24T02:13:35Z","subjects":["Group theory","Group theory--Generators","Abelian groups","Algebra","Other Mathematics"],"languages":[],"rights":["Access is available to all users"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://dc.ewu.edu/theses/235","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Frenk, Anthony"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"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 Science (MS) in Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Group theory","Group theory--Generators","Abelian groups","Algebra","Other Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Access is available to all users"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.ewu.edu/theses/235"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis.
"]},{"key":"dc:title","label":"Title","values":["The Gordon game"]}]}],"canonical_facts":{"dc:creator":["Frenk, Anthony"],"dc:description.abstract":["In 1992, about 30 years after Gordon introduced group sequencings to construct row-complete Latin squares, John Isbell introduced the idea of competitive sequencing, the Gordon Game. Isbell investigated the Gordon Game and found solutions for groups of small order. The purpose of this thesis is to analyze the Gordon Game and develop a brute force method of determining solutions to the game for all groups of order 12 (up to isomorphism) as well as for abelian groups of order less than 20. The method used will be a depth first search program written in MATLAB. Consequently, group representation using matrices will be studied within the thesis.
"],"dc:identifier":["https://dc.ewu.edu/theses/235"],"dc:rights":["Access is available to all users"],"dc:subject":["Group theory","Group theory--Generators","Abelian groups","Algebra","Other Mathematics"],"dc:title":["The Gordon game"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS) in Mathematics"]},"updated_at":"2026-07-24T02:13:35Z"}