Abstract
A general group theoretic approach is used to find resolvable designs. Infinitely many resolvable 3-designs are obtained where each is block transitive under some PSL(2, p f) or PGL(2, p f). Some known Steiner 5-designs are assembled from such resolvable 3-designs such that they are also resolvable. We give some visualizations of Steiner systems which make resolvability obvious.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Th. Beth, D. Jungnickel and H. Lenz, Design Theory, second edition, Cambridge University Press (1999).
W. Burnside, Theory of Groups of Finite Order, second edition, Cambridge (1911) (reprint Dover Publ. 1955).
R. H. F. Denniston, Some new 5–designs, Bull. London Math. Soc., Vol. 8 (1976) pp. 263–267.
L. E. Dickson, Linear Groups with an Exposition of the Galois Field Theory, Teubner 1901, Leipzig (reprint Dover Publ. 1958, New York).
B. Huppert, Endliche Gruppen I, Springer Grundlehren der mathematischen Wissenschaften Bd, Vol. 134 (1967).
B. Kaski, L. B. Morales, P. R. J. Ostergard, D. A. Rosenblueth and C. Velarde, Classification of resolvable 2–(14; 7; 12) and 3–(14; 7; 5) designs, J. Comb. Math. and Comb. Comp., Vol. 7 (2003) pp. 65–74.
A. Kohnert and R. Laue, GRAPH Database, btm2xg.mat.unibayreuth.de/GRAPHDB/.
E. S. Kramer, S. S. Magliveras and D. M. Mesner, Some resolutions of S(5; 8; 24), J. Comb. Theory A, Vol. 29 (1980) pp. 166–173.
R. Laue, Eine konstruktive Version des Lemmas von Burnside, Bayreuther Math. Schr., Vol. 28 (1989) pp. 111–125.
R. A. Liebler, S. S. Magliveras and S. V. Tsaranov, Block transitive resolutions of t-designs and Room rectangles, J. for Statist. Planning and Inference, Vol. 58 (1997) pp. 119–133.
J. Sarmiento, Resolutions of PG(5; 2) with point-cyclic automorphism group, J. Comb. Des., Vol. 8 (2000) pp. 2–14.
Tran van Trung, Recursive constructions for 3–designs and resolvable 3–designs, J. Statist. Planning and Inference, Vol. 95 (2001) pp. 341–358.
Tran van Trung, Construction of 3–designs using parallelism, J. Geom., Vol. 67 (2000) pp. 223–235.
E. Witt, Die 5–fach transitiven Gruppen von Mathieu, Abh. Math. Seminar Univ. Hamburg, Vol. 12 (1938) pp. 256–264.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Laue, R. Resolvable t-Designs. Designs, Codes and Cryptography 32, 277–301 (2004). https://doi.org/10.1023/B:DESI.0000029230.50742.8f
Issue Date:
DOI: https://doi.org/10.1023/B:DESI.0000029230.50742.8f