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

Resolvable Mendelsohn triple systems with equal sized holes

โœ Scribed by F. E. Bennett; R. Wei; L. Zhu


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

No coin nor oath required. For personal study only.

โœฆ Synopsis


An HMTS of type {n1 , n2 , . . . , n h } is a directed graph DKn 1 ,n 2 ,...,n h , which can be decomposed into 3-circuits. If the 3-circuits can be partitioned into parallel classes, then the HMTS is called an RHMTS. In this article it is shown that the RHMTSs of type m h exist when mh โ‰ก 0 (mod 3) and (m, h) / = (1, 6), with the possible exception of h = 6 and m / โˆˆ M17 , where M17 = {m|m is divisible by a prime less than 17}. The existence of Mendelsohn frames, which is closely related to RHMTS, is also considered in this article. It is proved that a Mendelsohn frame of type t u exists if and only if u โ‰ฅ 4 and t(u -1) โ‰ก 0 (mod 3) with 2 possible exceptions.


๐Ÿ“œ SIMILAR VOLUMES


Perfect Mendelsohn designs with equal-si
โœ F. E. Bennett; Zhang Xuebin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB

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)

Generalized steiner triple systems with
โœ K. Chen; G. Ge; L. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB ๐Ÿ‘ 1 views

Generalized Steiner triple systems, GS(2, 3, n, g) are used to construct maximum constant weight codes over an alphabet of size g 1 with distance 3 and weight 3 in which each codeword has length n. The existence of GS(2, 3, n, g) has been solved for g 2, 3, 4, 9. In this paper, by introducing a spec