## Abstract A resolvable modified group divisible design (RMGDD) is an MGDD whose blocks can be partitioned into parallel classes. In this article, we investigate the existence of RMGDDs with block size three and show that the necessary conditions are also sufficient with two exceptions. © 2005 Wil
α-Resolvable group divisible designs with block size three
✍ Scribed by Yan Zhang; Beiliang Du
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 123 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A group divisible design GD(k,λ,t;tu) is α‐resolvable if its blocks can be partitioned into classes such that each point of the design occurs in precisely α blocks in each class. The necessary conditions for the existence of such a design are λ__t__(u − 1) = r(k − 1), bk = rtu, k|α__tu__ and α|r. It is shown in this paper that these conditions are also sufficient when k = 3, with some definite exceptions. © 2004 Wiley Periodicals, Inc.
📜 SIMILAR VOLUMES
## Abstract The object of this paper is the construction of incomplete group divisible designs (IGDDs) with block size four, group‐type (__g, h__)^__u__^ and index unity. It is shown that the necessary conditions for the existence of such an IGDD are also sufficient with three exceptions and six po
We determine a necessary and sufficient condition for the existence of a cyclic {3} -GDD with a uniform group size g. Recursive and new computational methods are introduced to settle this problem completely.
An a-resolvable BIBD is a BIBD with the property that the blocks can be partitioned into disjoint classes such that every class contains each point of the design exactly times. In this paper, we show that the necessary conditions for the existence of -resolvable designs with block size four are suf®
## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ have been studied by Schellenberg, Chen, Lindner and Stinson. These large sets have applications in cryptography in the construction of perfect threshold schemes. It is known that such large sets
## Abstract Large sets of disjoint group‐divisible designs with block size three and type 2^__n__^4^1^ (denoted by __LS__ (2^__n__^4^1^)) were first studied by Schellenberg and Stinson and motivated by their connection with perfect threshold schemes. It is known that such large sets can exist only