<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T21:53:31Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1178" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1178</identifier><datestamp>2017-03-21T19:04:04Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="1bf073f3-13d7-4bf9-bfc9-34704b8bc407" confidence="600">Bauman, Shane</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:21:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:21:32Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1178</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A balanced tournament design of order &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;, BTD(&amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;), defined on a 2&amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;-set&amp;lt;I&amp;gt; V&amp;lt;/i&amp;gt;, is an arrangement of the all of the (2&amp;lt;I&amp;gt;n&amp;lt;/i&amp;gt;2) distinct unordered pairs of elements of &amp;lt;I&amp;gt;V&amp;lt;/I&amp;gt; into an &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;  X (2&amp;lt;I&amp;gt;n&amp;lt;/i&amp;gt; - 1) array such that (1) every element of  &amp;lt;I&amp;gt;V&amp;lt;/i&amp;gt; occurs exactly once in each column and (2) every element of &amp;lt;I&amp;gt;V&amp;lt;/I&amp;gt; occurs at most twice in each row.    We will show that there exists a BTD(&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;) for &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; a positive integer, &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; not equal to 2.    For &amp;lt;I&amp;gt;n&amp;lt;/i&amp;gt; = 2, a BTD (&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;) does not exist.   If the BTD(&amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt;) has the additional property that it is possible to permute the columns of the array such that for every row, all the elements of&amp;lt;I&amp;gt; V&amp;lt;/I&amp;gt; appear exactly once in the first &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; pairs of that row and exactly once in the last &amp;lt;i&amp;gt;n&amp;lt;/i&amp;gt; pairs of that row then we call the design a partitioned balanced tournament design, PBTD(&amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;).   We will show that there exists a PBTD (&amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;) for &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt; a positive integer, &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt; is greater than and equal to 5, except possibly for &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt; an element of the set {9,11,15}.    For &amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt; less than and equal to 4 a PBTD(&amp;lt;I&amp;gt;n&amp;lt;/I&amp;gt;) does not exist.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">438868 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2001, 
  Bauman, Shane. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">combinatorial designs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">balanced tournament designs</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">partitioned balanced tournament designs</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>