The number of repeated blocks in balanced ternary designs with block size three. II (Q1182919)
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: The number of repeated blocks in balanced ternary designs with block size three. II |
scientific article; zbMATH DE number 32446
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of repeated blocks in balanced ternary designs with block size three. II |
scientific article; zbMATH DE number 32446 |
Statements
The number of repeated blocks in balanced ternary designs with block size three. II (English)
0 references
28 June 1992
0 references
The following statement is proved: a balanced ternary design on \(v\) elements with block size three, index two, and each element repeated in precisely two blocks, and having exactly \(k\) pairs of repeated blocks exists if and only if \(v\equiv 0,2\pmod 3\), \(v\geq 5\), \(0\leq k\leq v(v- 5)/6\), and \(k\neq v(v-5)/6-1\). The proof rests on direct solutions for small cases, followed by recursive techniques.
0 references
balanced ternary designs
0 references
repeated blocks
0 references
0.8996897
0 references