New \(\mathbb{Z}\)-cyclic triplewhist frames and triplewhist tournament designs (Q2499587)

A triplewhist tournament design is a resolvable or near-resolvable balanced incomplete block design with order \(v\), block size four, and index three, in which every block \(\{a,b,c,d\}\) of size four is ordered \((a,b,c,d)\) so that every unordered pair appears once in positions \((1,2)\) or \((3,4)\); once in positions \((1,3)\) or \((2,4)\); and once in positions \((1,4)\) or \((2,3)\). Such a design is \(\mathbb Z\)-cyclic if the elements are those of \({\mathbb Z}_v\) when \(v \equiv 1 \pmod{4}\) or \({\mathbb Z}_{v-1} \cup \{\infty\}\) when \(v \equiv 0\pmod{4}\), and each parallel class (``round'') can be obtained from a base resolution by adding each nonzero element in turn to each element of each block in the base resolution. In this paper, substantial progress is made on the existence problem for \(\mathbb Z\)-cyclic triplewhist tournament designs, using a generalization to triplewhist tournament frames and progress on the existence of cyclic difference matrices with five rows.