Balanced generalized handcuffed designs
โ Scribed by Francis Maurin
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 465 KB
- Volume
- 110
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The definition of balanced generalized handcuffed designs (BHD) is of course more specific than that of the generalized handcuffed designs that we introduced in 1987. In the first part of this paper, we present a particular property of a BHD, which is not necessarily that of a generalized handcuffed design. Then, we provide the reader with a general procedure that enables one to obtain such designs, and is called a 'difference method'. We also show how this difference method can be made more useful in the case where the set V on which a BHD is constructed is the residue classes of integers mod V.
The third part of this paper deals with the problem of the existence of a BHD; and a solution is given for a particular case. We assume that the method applied for solving this problem will allow for the constructing of many more theorems analogous to Theorem 3.
๐ SIMILAR VOLUMES
Lamken, E.R., On near generalized balanced tournament designs, Discrete Mathematics 97 (1991) 279-294. A near generalized balanced tournament design, NGBTD(n, k), defined on a (kn + l)-set V, is an arrangement of the blocks of a (kn + 1, k, k -I)-BIBD defined on V into an n x (kn + 1) array so that
The concept of generalized partially balanced incomplete block (PBIB) design is introduced. Generalized PBIB designs are shown to be useful for the construction of equireplicate balanced block designs, pairwise balanced designs and BIB designs.