The aim of this note is to show how existing product constructions for cyclic and 1-rotational block designs can be adapted to provide a highly effective method of obtaining product theorems for whist tournaments.
Construction of Z-cyclic triple whist tournaments
โ Scribed by Y. S. Liaw
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 735 KB
- Volume
- 4
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
โฆ Synopsis
Let p = Z k t + 1 be a prime where t > 1 is an odd integer, k 2 2. Methods of constructing a Z-cyclic triple whist tournament TWh(p) are given. By such methods we construct a Z-cyclic TWh(p) for d l primes p , p = l(mod 4), 29 5 p 5 16097, except p = 257. Let p , = 2ktt, + 1, q = Zk0oto + 3 be primes where t , ; z = 0,1,. . . , n. are odd > 1 and k, are integers 2 2. We prove that if Z-cyclic TWh(p,) and TWh(q + 1) exist then Z-cyclic TWh(n,"=l p p z ) and T W h ( q n r = , pPt + 1) exist.
๐ SIMILAR VOLUMES
A Z-cyclic triplewhist tournament for 4n+1 players, or briefly a TWh(4n+1), is equivalent to a . The existence problem for Z-cyclic TWh( p)'s with p a prime has been solved for p 1 (mod 16). I. Anderson