The Gordon game

<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>

Name thesis:degree_name

Master of Science (MS) in Mathematics

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Mathematics

Year

2013

Author dc:creator

• Frenk, Anthony

• Group theory
• Group theory--Generators
• Abelian groups
• Algebra
• Other Mathematics

Statement dc:rights

• Access is available to all users

Repository record dc:identifier

https://dc.ewu.edu/theses/235

OAI identifier oai:identifier

oai:dc.ewu.edu:theses-1234