No label defined (Q3788022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4051638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4051638 |
Statements
1987
0 references
balanced tournament design
0 references
partially balanced tournament design
0 references
BTD
0 references
PBTD
0 references
A BTD(n) defined on a 2n-set V is an arrangement of the \(\left( \begin{matrix} 2n\\ n\end{matrix} \right)\) distinct unordered pairs of the elements of V into an \(n\times 2n-1\) array such that 1) every element of V is contained in precisely one cell of each column and 2) every element of V is contained in at most two cells of each row. Let \(| V| =2n\). An \(H(s,2n)\) is an \(s\times s\) array in which each cell is either empty or contains an unordered pair of elements from V such that each row and each column is Latin and every unordered pair of elements of V is in at most one cell of the array. If we can partition the columns of a \(BTD(n)\) into three sets \(C_ 1\), \(C_ 2\), \(C_ 3\) of sizes *, n-1, n-1 respectively so that the columns in \(C_ 1\cup C_ 2\) form an \(H(n,2n)\) and the columns in \(C_ 1\cup C_ 3\) form an \(H(n,2n)\) then the \(BTD(n)\) is called partitionable and denoted by PBTD(n). A new construction for PBTDs is described which gives PBTD(n) for \(n\in \{32,38,58,94\}.\) Now we can conclude that there exists a PBTD(n) for each \(n\geq 5\) except possibly \(n=\{9,11,15,26,28,34,44\}.\)
0 references