1 |
A VARIATION ON MUTUALLY ORTHOGONAL LATIN SQUARESGunawardana, Beruwalage Lakshika Kumari 01 August 2016 (has links)
A Latin square of order n is an n × n array in which each row and column contains symbols from an n-set, S = {a1,...,an}, exactly once. If two Latin squares L1 and L2 of the same order can be joined such that each of the n^2 ordered pairs (ai,aj) appears exactly once, then L1 and L2 are said to be orthogonal. This project will involve a variation of this idea. We define orthogonality of two Latin squares Lm and Ln, for m < n, as follows: When we place an m × m Latin square Lm inside an n × n Latin square Ln, in all possible ways, the so obtained m^2 ordered pairs (ai,aj) are always distinct. We first investigate the situation when m = 2 and n = p, where p is a prime.
|
2 |
Pairwise Balanced Designs of Dimension ThreeNiezen, Joanna 20 December 2013 (has links)
A linear space is a set of points and lines such that any pair of points lie on exactly one line together. This is equivalent to a pairwise balanced design PBD(v, K), where there are v points, lines are regarded as blocks, and K ⊆ Z≥2 denotes the set of allowed block sizes. The dimension of a linear space is the maximum integer d such that any set of d points is contained in a proper subspace. Specifically for K = {3, 4, 5}, we determine which values of v admit PBD(v,K) of dimension at least three for all but a short list of possible exceptions under 50. We also observe that dimension can be reduced via a substitution argument. / Graduate / 0405 / jniezen@uvic.ca
|
Page generated in 0.013 seconds