## Abstract Let __v,k__, and __n__ be positive integers. An incomplete perfect Mendelsohn design, denoted by __k__βIPMD__(v,n)__, is a triple (__X, Y__, πΉ) where __X__ is a __v__βset (of points), __Y__ is an __n__βsubset of __X__, and πΉ is a collection of cyclically ordered __k__βsubsets of __X__ (
Incomplete perfect mendelsohn designs with block size 4 and holes of size 2 and 3
β Scribed by F. E. Bennett; H. Shen; J. Yin
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 643 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Let v, k, and n be positive integers. An incomplete perfect Mendelsohn design, denoted by kβIPMD(v, n), is a triple (X, Y, πΉ) where X is a vβset (of points), Y is an nβsubset of X, and πΉ is a collection of cyclically ordered kβsubsets of X (called blocks) such that every ordered pair (a, b) β (X Γ X)(Y Γ Y) appears tβapart in exactly one block of πΉ and no ordered pair (a,b) β Y Γ Y appears in any block of πΉ for any t, where 1 β€ t β€ k β 1. In this article, the necessary conditions for the existence of a 4βIPMD(v, n), namely (v β n) (v β 3n β 1) β‘ 0 (mod 4) and v β₯ 3n + 1, are shown to be sufficient for the case n = 3. For the case n = 2, these conditions are sufficient except for v = 7 and with the possible exception of v = 14,15,18,19,22,23,26,27,30. The latter result provides a useful application to the problem relating to the packing of perfect Mendelsohn designs with block size 4. Β© 1994 John Wiley & Sons, Inc.
π SIMILAR VOLUMES
Let M = {m1 , m2 , . . . , m h } and X be a v-set (of points). A holey perfect Mendelsohn designs (briefly (v, k, Ξ») -HPMD), is a triple (X, H, B), where H is a collection of subsets of X (called holes) with sizes M and which partition X, and B is a collection of cyclic k-tuples of X (called blocks)
## Abstract Splitting balanced incomplete block designs were first formulated by Ogata, Kurosawa, Stinson, and Saido recently in the investigation of authentication codes. This article investigates the existence of splitting balanced incomplete block designs, i.e., (__v__, 3__k__, Ξ»)βsplitting BIBD
A Mendelsohn design MD(v, k, Ξ») is a pair (X, B) where X is a v-set together with a collection B of cyclic k-tuples from X such that each ordered pair from X, as adjacent entries, is contained in exactly Ξ»k-tuples of B. The existence of SCMD(v, 3, Ξ») and SCMD(v, 4, 1) has been settled by us. In thi