Abstract
In 1987, Hartman showed that the necessary condition v ≡ 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(2n), namely, n ≡ 2 or 4 (mod 6) and n ≥ 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 ≡ 1 or 2 (mod 3) and n ≥ 4 for the existence of an RH(4n) are also sufficient for all values of n except possibly n ∈ {73, 149}. As a consequence, the general existence problem of an RH(g n) is solved leaving mainly the case of g ≡ 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.
Similar content being viewed by others
References
Booth T.R.: A resolvable quadruple system of order 20. Ars Combin. 5, 121–125 (1978)
Cao H., Ji L., Zhu L.: Construction for generalized Steiner systems. Des. Codes Cryptogr. 45, 185–197 (2007)
Colbourn C.J., Dinitz J.H.: CRC Handbook of Combinatorial Designs. CRC Press Inc., Boca Raton (2007)
Greenwell D.L., Lindner C.C.: Some remarks on resolvable quadruple systems. Ars Combin. 6, 215–221 (1978)
Hanani H.: On quadruple systems. Canad. J. Math. 12, 145–157 (1960)
Hartman A.: Resolvable Steiner quadruple systems. Ars Combin. 9, 263–273 (1980)
Hartman A.: Kirkman’s trombone player problem. Ars Combin. 10, 19–26 (1980)
Hartman A.: Tripling quadruple systems. Ars Combin. 10, 255–309 (1980)
Hartman A.: The existence of resolvable Steiner quadruple systems. J. Combin. Theory Ser. A 44, 182–206 (1987)
Hartman A., Mills W.H., Mullin R.C.: Covering triples by quadruple: an asymptotic solution. J. Combin. Theory Ser. A 41, 117–138 (1986)
Ji L.: An improvement on H design. J. Combin. Des. 17, 25–35 (2009)
Ji L., Zhu L.: Resolvable Steiner quadruple systems for the last 23 orders. SIAM J. Discrete Math. 19, 420–430 (2005)
Meng Z., Ji L., Du B.: Uniformly resolvable three-wise balanced designs with block sizes four and six. Discrete Math. (to appear). doi:10.1016/j.disc.2009.06.015.
Mills W.H.: On the existence of H designs. Congr. Numer. 79, 129–141 (1990)
Stern G., Lenz H.: Steiner triple systems with given subspaces, another proof of the Doyen–Wilson Theorem. Boll. Unione Mat. Ital. 5(17-A), 109–114 (1980)
Zhang X., Ge G.: Maximal resolvable packings and minimal resolvable coverings of triples by quadruples. J. Combin. Des. (to appear). doi:10.1002/jcd.20234.
Zhuralev A.A., Keranen M.S., Kreher D.L.: Small group divisiable Steiner quadruple systems. Electron. J. Combin. 15 (2008), no. 1, Research paper 40, 14 pp.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by L. Teirlinck.
Rights and permissions
About this article
Cite this article
Zhang, X., Ge, G. Existence of resolvable H-designs with group sizes 2, 3, 4 and 6. Des. Codes Cryptogr. 55, 81–101 (2010). https://doi.org/10.1007/s10623-009-9332-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9332-9