Hamiltonian decomposition of K∗n, patterns with distinct differences, and Tuscan squares

AbstractThis paper presents a few constructions for the decomposition of the complete directed graph on n vertices into n Hamiltonian paths. Some of the constructions will apply for even n and others to odd n. The constructions will be obtained from some patterns with distinct differences. The constructions will be exhibited by squares (called Tuscan squares) which sometimes are Latin squares (called Roman squares), and sometimes are not Latin. These squares have some special properties which are discussed in this paper

The Gordon game

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