Constructions for balanced Howell rotations for bridge tournaments
TLDR
It is shown that if n ≡ 0 mod 4, then the existence of such a rotation on n partnerships implies theexistence of an n × n Hadamard matrix, and the method succeeds in designing complete, balanced Howell rotations whenever n − 1 is a prime-power.About:
This article is published in Journal of Combinatorial Theory, Series A.The article was published on 1972-03-01 and is currently open access. It has received 25 citations till now. The article focuses on the topics: Bridge (interpersonal) & Hadamard matrix.read more
Citations
More filters
Journal ArticleDOI
The existence of Room squares
TL;DR: In this article, the authors give a condensed proof of the existence of room squares for positive odd sides except 3 and 5, and some areas of current research on room squares are also discussed.
Journal ArticleDOI
On balanced room squares and complete balanced howell rotations
TL;DR: A Room square (RS) as discussed by the authors is an arrangement of 2n elements (symbols) in a square array of side 2 n 1 such that each of the (2 n 1) 2 cells of the array is either empty or contains an unordered pair of distinct elements.
Journal ArticleDOI
Starter-adder methods in the construction of Howell designs
B. A. Anderson,K. B. Gross +1 more
TL;DR: In this paper, the existence question for many new types H(s, 2n) is settled affirmatively, and the powerful starter-adder theorems for constructing Howell designs are improved and consequently many types of Howell designs that previously could only be constructed by multiplicative techniques are shown amenable to a modified starter-adder method.
References
More filters
Journal ArticleDOI
Some Balanced Howell Rotations for Duplicate Bridge Sessions
E. T. Parker,Alexander M. Mood +1 more
TL;DR: Some Balanced Howell Rotations for Duplicate Bridge Sessions as mentioned in this paper have been used in the past few decades for bridge sessions, and have been shown to be useful in many problems in computer science.