Resolvable t-Designs

Authors:
Reinhard Laue
Affiliations:
Department of Mathematics, University of Bayreuth, 95440 Bayreuth, Germany laue@uni-bayreuth.de
Venue:
Designs, Codes and Cryptography
Year:
2004

Citing 1
Cited 1

Design theory

Design theory

Unifying some known infinite families of combinatorial 3-designs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

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, pf) or PGL(2, pf). 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.