๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Existence of HPMDs with block size five

โœ Scribed by F. E. Bennett; Y. Chang; J. Yin; H. Zhang


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
194 KB
Volume
5
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this article, it is shown that the necessary condition for the existence of a holey perfect Mendelsohn design (HPMD) with block size 5 and type h n , namely, n โ‰ฅ 5 and n(n -1)h 2 โ‰ก 0 (mod 5), is also sufficient, except possibly for a few cases. The results of this article guarantee the analogous existence results for group divisible designs (GDDs) of group-type h n with block size k = 5 and having index ฮป = 4. Moreover, some more conclusive results for the existence of (v, 5, 1)-perfect Mendelsohn designs (PMDs) are also mentioned.


๐Ÿ“œ SIMILAR VOLUMES


Existence of directed GDDs with block si
โœ F. E. Bennett; Nabil Shalaby; Jianxing Yin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 393 KB ๐Ÿ‘ 1 views

In this article, we construct directed group divisible designs (DGDDs) with block size five, group-type h n , and index unity. The necessary conditions for the existence of such a DGDD are n โ‰ฅ 5, (n -1)h โ‰ก 0 (mod 2) and n(n -1)h 2 โ‰ก 0 (mod 10). It is shown that these necessary conditions are also su

Existence of large sets of coverings wit
โœ L. Ji ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 84 KB ๐Ÿ‘ 1 views

## Abstract Two types of large sets of coverings were introduced by T. Etzion (J Combin Designs, 2(1994), 359โ€“374). What is maximum number (denoted by ฮป(__n,k__)) of disjoint optimal (__n,k,k__โ€‰โˆ’โ€‰1) coverings? What is the minimum number (denoted by ยต(__n,k__)) of disjoint optimal (__n,k,k__โ€‰โˆ’โ€‰1) co

Existence of large sets of disjoint grou
โœ L. Ji ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 2 views

## 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

On the E-Optimality of Block Designs wit
โœ Dr. Henryk Brzeskwiniewicz ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 192 KB ๐Ÿ‘ 2 views

In this paper an inequality for the smallest positive eigenvalues of the \_C-matrix of a block design are derived. This inequality is a generalization of a result by CONSTANTINE (1982) to the caw of unequal block sizes. On the basis of the above result a certain E-optimality criterium of block desig

The spectrum of ฮฑ-resolvable designs wit
โœ Troy M. J. Vasiga; Steven Furino; Alan C. H. Ling ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views

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ยฎ