𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Incomplete perfect mendelsohn designs wi
✍ F. E. Bennett; H. Shen; J. Yin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 676 KB

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

Perfect Mendelsohn designs with equal-si
✍ F. E. Bennett; Zhang Xuebin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 149 KB πŸ‘ 2 views

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)

Splitting balanced incomplete block desi
✍ Beiliang Du πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 149 KB

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

Self-converse Mendelsohn designs with bl
✍ Qingde Kang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 603 KB

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