Abstract
A Steiner quadruple system of order v is an ordered pair \({(X, \mathcal{B})}\), where X is a set of cardinality v, and \({\mathcal{B}}\) is a set of 4-subsets of X, called blocks, with the property that every 3-subset of X is contained in a unique block. Such designs exist if and only if \({v \equiv 2,4\, (\bmod\, 6)}\). The first and second proofs of this result were given by Hanani in 1960 and in 1963, respectively. All the existing proofs are rather cumbersome, even though simplified proofs have been given by Lenz in 1985 and by Hartman in 1994. To study Steiner quadruple systems, Hanani introduced the concept of H-designs in 1963. The purpose of this paper is to provide an alternative existence proof for Steiner quadruple systems via H-designs of type 2n. In 1990, Mills showed that for n > 3, n ≠ 5, an H-design of type g n exists if and only if ng is even and g(n − 1)(n − 2) is divisible by 3, where the main context is the complicated existence proof for H-designs of type 2n. However, Mill’s proof was based on the existence result of Steiner quadruple systems. In this paper, by using the theory of candelabra systems and H-frames, we give a new existence proof for H-designs of type 2n independent of the existence result of Steiner quadruple systems. As a consequence, we also provide a new existence proof for Steiner quadruple systems.
Similar content being viewed by others
References
Barrau J.A.: On the combinatory problem of Steiner. Proc. Sec. Sci. Kon Akad. Wetensch. Amst. 11, 352–360 (1908)
Carmichael R.D.: Introduction to the Theory of Groups of Finite Order. Ginn, Boston (1937); reprinted by Dover, New York (1956).
Chouinard L.G. II, Kramer E.S., Kreher D.L.: Graphical t-wise balanced designs. Discret. Math. 46, 227–240 (1983)
Hanani H.: On quadruple systems. Can. J. Math. 12, 145–157 (1960)
Hanani H.: On some tactical configurations. Can. J. Math. 15, 702–722 (1963)
Hartman A.: Tripling quadruple systems. Ars Combin. 10, 255–309 (1980)
Hartman A.: A general recursive construction for quadruple systems. J. Combin. Theory Ser. A. 33, 121–134 (1982)
Hartman A.: The fundamental constructions for 3-designs. Discrete Math. 124, 107–132 (1994)
Hartman A., Mills W.H., Mullin R.C.: Covering triples by quadruple: an asymptotic solution. J. Combin. Theory Ser. A 41, 117–138 (1986)
Hartman A., Phelps K.T.: Steiner quadruple systems. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory: A Collection of Surveys. Wiley, New York, pp. 117–138.
Ji L.: An improvement on H design. J. Combin. Des. 17, 25–35 (2009)
Kirman T.P.: On a problem in combinations. Camb. Dublin Math. J. 2, 191–204 (1847)
Lenz H.: Tripling Steiner quadruple systems. Ars Combin. 20, 193–202 (1985)
Mills W.H.: On the covering of triples by quadruples. Congr. Numer. 10, 563–581 (1974)
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. Un. Mat. Ital. (5) 17-A, 109–114 (1980).
Zhang X., Zhang H., Ge G.: Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four. Des. Codes Cryptogr. 62, 143–160 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by K. T. Arasu.
Rights and permissions
About this article
Cite this article
Zhang, X., Ge, G. A new existence proof for Steiner quadruple systems. Des. Codes Cryptogr. 69, 65–76 (2013). https://doi.org/10.1007/s10623-012-9621-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9621-6