Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"mutually orthogonal Latin squares"”.

  1. An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares

    An incomplete Latin square is a v x v array with an empty n x n subarray with every row and every column containing each symbol at most once and no row or column with an empty cell containing one of the last n symbols. A set of t incomplete mutually orthogonal Latin squares of order v and hole size …

    uvic Repository record for An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares (opens in a new tab)

  2. The search for a triple of mutually orthogonal Latin squares of order ten: looking through pairs of dimension thirty-five and less

    A computer generation of all pairs of mutually orthogonal Latin squares of order ten and dimension 35 or less is undertaken. All such pairs are successfully generated up to main class equivalence. No pairs of mutually orthogonal Latin squares of order ten exist for dimension 33. Six dimension 34 …

    uvic Repository record for The search for a triple of mutually orthogonal Latin squares of order ten: looking through pairs of dimension thirty-five and less (opens in a new tab)

  3. Musical chairs: A bridge club design using genetic algorithms

    … of the unsolved problem of finding three mutually orthogonal latin squares of order ten. This attempt is made with genetic algorithms because of their widespread success in solving difficult search or optimization problems and because they have solved a variation of this problem far better …

    iastate Repository record for Musical chairs: A bridge club design using genetic algorithms (opens in a new tab)

  4. Nets of order 4m+2: linear dependence and dimensions of codes

    … any two non-parallel lines meet exactly once. A Latin square of order n is an n by n array of symbols in which each row and column contains each symbol exactly once. Two Latin squares L and M are said to be orthogonal if the n2 ordered pairs (Li,j , Mi,j ) are all distinct. A set of t mutual ly …

    uvic Repository record for Nets of order 4m+2: linear dependence and dimensions of codes (opens in a new tab)

  5. Classification of small class association schemes coming from certain combinatorial objects

    … graphs, the desarguesian complete set of mutually orthogonal Latin squares, orthogonal arrays, and symmetric Bush-type Hadamard matrices, all of which give rise to many small-class association schemes. We work within the framework of the theory of association schemes.;Our focus is placed …

    iastate Repository record for Classification of small class association schemes coming from certain combinatorial objects (opens in a new tab)

  6. Automorphism groups of resolvable incidence structure

    … Block Designs which arise from complete sets of mutually orthogonal Latin squares. The blocks of a net can be partitioned into equivalence classes called parallel classes, in which no two blocks in the same parallel class meet, and any two blocks from distinct parallel classes meet in exactly the …

    must-thes Repository record for Automorphism groups of resolvable incidence structure (opens in a new tab)

  7. Minimal Ramsey graphs, orthogonal Latin squares, and hyperplane coverings

    … The second part of the thesis deals with orthogonal Latin squares. A {\em Latin square of order $n$} is an $n\times n$ array with entries in $[n]$ such that each integer appears exactly once in every row and every column. Two Latin squares $L$ and $L'$ are said to be {\em orthogonal} if, …

    fu-berlin Repository record for Minimal Ramsey graphs, orthogonal Latin squares, and hyperplane coverings (opens in a new tab)