Existence of resolvable H-designs with group sizes 2, 3, 4 and 6

被引:7
|
作者
Zhang, Xiande [1 ]
Ge, Gennian [1 ]
机构
[1] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
基金
中国国家自然科学基金;
关键词
B-4-pairings; Candelabra systems; G-designs; H-designs; H-frames; Resolvable; Steiner quadruple systems; STEINER QUADRUPLE SYSTEMS; TRIPLES;
D O I
10.1007/s10623-009-9332-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In 1987, Hartman showed that the necessary condition v a parts per thousand 4 or 8 (mod 12) for the existence of a resolvable SQS(v) is also sufficient for all values of v, with 23 possible exceptions. These last 23 undecided orders were removed by Ji and Zhu in 2005 by introducing the concept of resolvable H-designs. In this paper, we first develop a simple but powerful construction for resolvable H-designs, i.e., a construction of an RH(g (2n) ) from an RH((2g) (n) ), which we call group halving construction. Based on this construction, we provide an alternative existence proof for resolvable SQS(v)s by investigating the existence problem of resolvable H-designs with group size 2. We show that the necessary conditions for the existence of an RH(2 (n) ), namely, n a parts per thousand 2 or 4 (mod 6) and n a parts per thousand yen 4 are also sufficient. Meanwhile, we provide an alternative existence proof for resolvable H-designs with group size 6. These results are obtained by first establishing an existence result for resolvable H-designs with group size 4, that is, the necessary conditions n a parts per thousand 1 or 2 (mod 3) and n a parts per thousand yen 4 for the existence of an RH(4 (n) ) are also sufficient for all values of n except possibly n a {73, 149}. As a consequence, the general existence problem of an RH(g (n) ) is solved leaving mainly the case of g a parts per thousand 0 (mod 12) open. Finally, we show that the necessary conditions for the existence of a resolvable G-design of type g (n) are also sufficient.
引用
收藏
页码:81 / 101
页数:21
相关论文
共 50 条
  • [41] ON UNIFORMLY RESOLVABLE {K2, Pk-DESIGNS WITH k=3,4
    Gionfriddo, Mario
    Milici, Salvatore
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2015, 10 (01) : 126 - 133
  • [42] FURTHER RESULTS ON THE EXISTENCE OF SUPER-SIMPLE PAIRWISE BALANCED DESIGNS WITH BLOCK SIZES 3 AND 4
    Chen, Guangzhou
    Guo, Yue
    Zhang, Yong
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2018, 12 (02) : 351 - 362
  • [43] THE EXISTENCE OF DOUBLY RESOLVABLE (V,3,2)-BIBDS
    LAMKEN, ER
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1995, 72 (01) : 50 - 76
  • [44] A construction of group divisible designs with block sizes 3 to 7
    Lee, Chong-Dao
    Chang, Yaotsu
    Liu, Chia-an
    DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (06) : 1281 - 1293
  • [45] A construction of group divisible designs with block sizes 3 to 7
    Chong-Dao Lee
    Yaotsu Chang
    Chia-an Liu
    Designs, Codes and Cryptography, 2018, 86 : 1281 - 1293
  • [46] BALANCED TOURNAMENT DESIGNS AND RESOLVABLE (NU,3,2)-BIBDS
    LAMKEN, ER
    VANSTONE, SA
    DISCRETE MATHEMATICS, 1990, 83 (01) : 37 - 47
  • [47] PAIRWISE BALANCED DESIGNS WITH BLOCK SIZES 3 AND 4
    COLBOURN, CJ
    ROSA, A
    STINSON, DR
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1991, 43 (04): : 673 - 704
  • [48] The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
    Harri Haanpää
    Petteri Kaski
    Designs, Codes and Cryptography, 2005, 35 : 271 - 285
  • [49] ON UNIFORMLY RESOLVABLE (C4, K1,3)-DESIGNS
    Bonacini, P.
    Kucukcifci, S.
    Milici, S.
    Yazici, E. S.
    CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2022, 17 (02) : 1 - 22
  • [50] Classification of affine resolvable 2-(27,9,4) designs
    Lam, C
    Tonchev, VD
    JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1996, 56 (02) : 187 - 202