|
Designs and their algebraic theory
Kozlík, Andrew
It is well known that for any Steiner triple system (STS) one can define a binary operation · upon its base set by assigning x·x = x for all x and x·y = z, where z is the third point in the block containing the pair {x, y}. The same can be done for Mendelsohn triple systems (MTS), directed triple systems (DTS) as well as hybrid triple systems (HTS), where (x, y) is considered to be ordered. In the case of STSs and MTSs the operation yields a quasigroup, however this is not necessarily the case for DTSs and HTSs. A DTS or an HTS which induces a quasigroup is said to be Latin. The quasigroups associated with STSs and MTSs satisfy the flexible law x · (y · x) = (x · y) · x but those associated with Latin DTSs and Latin HTSs need not. A DTS or an HTS is said to be pure if when considered as a twofold triple system it contains no repeated blocks. This thesis focuses on the study of Latin DTSs and Latin HTSs, in particular it aims to examine flexibility, purity and other related properties in these systems. Latin DTSs and Latin HTSs which admit a cyclic or a rotational automorphism are also studied. The existence spectra of these systems are proved and enumeration results are presented. A smaller part of the thesis is then devoted to examining the size of the centre of a Steiner loop and the connection to...
|
|
Three-Line Latin Rectangles and Associativity
Onduš, Daniel ; Drápal, Aleš (advisor) ; Vojtěchovský, Petr (referee)
This thesis deals with properties of permutations and three-line latin rectan- gles. In the first part it offers solutions to several combinatorial problems and derrives formula for enumeration of three-line latin rectangles and its simplifica- tion based on articles by J. Riordan, but unlike Riordan's articles, without use of generating functions. In the second part it shows algebraic properties of permu- tation conjugation. Furthermore it provides an algorithm that constructs set of permutations commuting with a given permutation and enumerates orbits of the set of three-line latin rectangles when conjugating by the group of permutations Sn for small n.
|
|
Designs and their algebraic theory
Kozlík, Andrew ; Drápal, Aleš (advisor) ; Donovan, Diane (referee) ; Lindner, Charles Curtis (referee)
It is well known that for any Steiner triple system (STS) one can define a binary operation · upon its base set by assigning x·x = x for all x and x·y = z, where z is the third point in the block containing the pair {x, y}. The same can be done for Mendelsohn triple systems (MTS), directed triple systems (DTS) as well as hybrid triple systems (HTS), where (x, y) is considered to be ordered. In the case of STSs and MTSs the operation yields a quasigroup, however this is not necessarily the case for DTSs and HTSs. A DTS or an HTS which induces a quasigroup is said to be Latin. The quasigroups associated with STSs and MTSs satisfy the flexible law x · (y · x) = (x · y) · x but those associated with Latin DTSs and Latin HTSs need not. A DTS or an HTS is said to be pure if when considered as a twofold triple system it contains no repeated blocks. This thesis focuses on the study of Latin DTSs and Latin HTSs, in particular it aims to examine flexibility, purity and other related properties in these systems. Latin DTSs and Latin HTSs which admit a cyclic or a rotational automorphism are also studied. The existence spectra of these systems are proved and enumeration results are presented. A smaller part of the thesis is then devoted to examining the size of the centre of a Steiner loop and the connection to...
|
|
Designs and their algebraic theory
Kozlík, Andrew
It is well known that for any Steiner triple system (STS) one can define a binary operation · upon its base set by assigning x·x = x for all x and x·y = z, where z is the third point in the block containing the pair {x, y}. The same can be done for Mendelsohn triple systems (MTS), directed triple systems (DTS) as well as hybrid triple systems (HTS), where (x, y) is considered to be ordered. In the case of STSs and MTSs the operation yields a quasigroup, however this is not necessarily the case for DTSs and HTSs. A DTS or an HTS which induces a quasigroup is said to be Latin. The quasigroups associated with STSs and MTSs satisfy the flexible law x · (y · x) = (x · y) · x but those associated with Latin DTSs and Latin HTSs need not. A DTS or an HTS is said to be pure if when considered as a twofold triple system it contains no repeated blocks. This thesis focuses on the study of Latin DTSs and Latin HTSs, in particular it aims to examine flexibility, purity and other related properties in these systems. Latin DTSs and Latin HTSs which admit a cyclic or a rotational automorphism are also studied. The existence spectra of these systems are proved and enumeration results are presented. A smaller part of the thesis is then devoted to examining the size of the centre of a Steiner loop and the connection to...
|