Balanced ternary designs with block size three, any \(\Lambda\) and any R (Q1093641)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Balanced ternary designs with block size three, any \(\Lambda\) and any R |
scientific article; zbMATH DE number 4023295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Balanced ternary designs with block size three, any \(\Lambda\) and any R |
scientific article; zbMATH DE number 4023295 |
Statements
Balanced ternary designs with block size three, any \(\Lambda\) and any R (English)
0 references
1985
0 references
A balanced ternary design with V elements is a collection of B blocks (which are multisets) of size K such that each element occurs 0, 1 or 2 times per block and R times altogether, and such that each unordered pair of distinct elements occur \(\Lambda\) times. Then each element has to occur singly in a constant number \(\rho_ 1\) o blocks and so each element also occurs twice in a constant number \(\rho_ 2\) of blocks, where \(R=\rho_ 1+2\rho_ 2\). If \(\rho_ 2=0\), the design is a balanced incomplete block design (binary design). For non-degeneracy, it is assumed that \(\rho_ 2>0\) and \(K<2V\). Necessarily, \(\Lambda >1\) if \(\rho_ 2>0\) (and \(K>2).\) In this paper, the author gives necessary and sufficient conditions for the existence of a balanced ternary design with \(K=3\), and \(\Lambda >1\) and any \(\rho_ 2>0\).
0 references
balanced ternary design
0 references