NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 2 of 2 (0.04 seconds)

Spelling suggestions: "subject:"pairwise balanced design"" "subject:"fairwise balanced design""

1

An Asymptotic Existence Theory on Incomplete Mutually Orthogonal Latin Squares

van Bommel, Christopher Martin 23 March 2015 (has links)
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 n is a set of t incomplete Latin squares (containing the same empty subarray on the same set of symbols) with a natural extension to the condition of orthogonality. The existence of such sets have been previously explored only for small values of t. We determine an asymptotic result for the existence of t incomplete mutually orthogonal Latin squares for general t requiring large holes, which we develop from our results on incomplete pairwise balanced designs and incomplete group divisible designs. / Graduate
Latin square
Hole
Pairwise balanced design
2

Pairwise Balanced Designs of Dimension Three

Niezen, 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
pairwise balanced design
PBD
Latin square
MOLS
GDD
dimension
linear space
game of Set
Steiner triple system
STS
Steiner space
subspace
Wilson's construction

Page generated in 0.0437 seconds