✦ LIBER ✦

Cyclically resolvable designs and triple whist tournaments

✍ Scribed by I. Anderson; N. J. Finizio

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 552 KB
Volume: 1
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.3180010504

No coin nor oath required. For personal study only.

✦ Synopsis

We construct cyclically resolvable (v, 4 , l ) designs and cyclic triple whist tournaments Twh(v)

for all v of the form 3pt'. . .p> + 1, where the pi are primes 3 1 (mod 4), such that each p1 -1 is divisible by the same power of 2.

📜 SIMILAR VOLUMES

Construction of Z-cyclic triple whist to

Construction of Z-cyclic triple whist tournaments

✍ Y. S. Liaw 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

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 prime

A representation theorem and Z-cyclic wh

A representation theorem and Z-cyclic whist tournaments

✍ Norman J. Finizio 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

Let E denote the group of units (i.e., the reduce set of residues) in the ring Z3p,,n. Here we consider q,p to be primes, q = 3 (mod 4), q 2 7, p = 1 (mod 4). Let W denote a common primitive root of 3, q, and p 2 . If H denotes the (normal) subgroup of E that is generated by {-1, W } , we show that

Balanced tournament designs and resolvab

Balanced tournament designs and resolvable (υ, 3, 2)-bibds

✍ E.R. Lamken; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 721 KB

In this paper, we present new constructions for resolvable and near resolvable (v, 3, 2)-BIBDs. These constructions use balanced tournament designs and odd balanced tournament designs. We then use balanced tournament designs with almost orthogonal resolutions and odd balanced tournament designs with