## 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__ (
Existence of perfect Mendelsohn designs with k=5 and λ>1
✍ Scribed by F.E. Bennett; K.T. Phelps; C.A. Rodger; J. Yin; L. Zhu
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 510 KB
- Volume
- 103
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
Zhu, L., B. Du and X. Zhang, A few more RBIBDs with k =5 and A = 1, Discrete Mathematics 97 (1991) 409-417. It has been shown that there exists a (u, 5, l)-RBIBD for any positive integer u = 5 (mod 20) with 147 possible exceptions. We show that such designs exist for 34 of these values.
In this article, we investigate the existence of pure (v,4,A)-PMD with A = 1 and 2, and obtain the following results: (1) a pure (v, 4,1)-PMD exists for every positive integer Y = 0 or 1 (mod 4) with the exception of v = 4 and 8 and the possible exception of v = 12; (2) a pure (v,4,2)-PMD exists for
The existence of a (q, k, 1) difference family in GF(q) has been completely solved for k = 3. For k = 4, 5 partial results have been given by Bose, Wilson, and Buratti. In this article, we continue the investigation and show that the necessary condition for the existence of a (q, k, 1) difference fa