Balanced tournament designs with almost orthogonal resolutions
نویسندگان
چکیده
منابع مشابه
The existence of court balanced tournament designs
Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the (“2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in each row. We show that CBTD(n,c) exist for all n and c satisfying cl(;) and c( n 1 and discuss t...
متن کاملGeneralized Balanced Tournament Designs with Block Size Four
In this paper, we remove the outstanding values m for which the existence of a GBTD(4,m) has not been decided previously. This leads to a complete solution to the existence problem regarding GBTD(4,m)s.
متن کاملThe Existence of Near Generalized Balanced Tournament Designs
In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.
متن کاملGeneralized whist tournament designs
In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players on each team and the number of teams i...
متن کاملSplittable Triplewhist Tournament Designs
We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1990
ISSN: 0263-6115
DOI: 10.1017/s1446788700030470