Abstract
A (v, k, 1)-BIBD D is said to be doubly resolvable if there exists a \(\frac{{\upsilon - 1}}{{k - 1}} \times \frac{{\upsilon - 1}}{{k - 1}}\) array A such that each cell of A is either empty or contains a block of D, each variety of D is contained in one cell of each row and column of A and every block of D is in some cell of A. In this paper, we investigate automorphisms of such arrays.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.J. Dickey and Ryoh Ruji-Hara, A geometrical construction for doubly resolvable (n2+n+1,1)-designs, Ars Combin. 8 (1979), 3–12.
D.R. Hughes and F. Piper, Projective planes (Springer-Verlag, New York, 1973).
R. Mathon and S.A. Vanstone, On the existence of doubly resolvable Kirkman systems and equidistant permutation arrays, Discrete Math. (to appear).
R.C. Mullin and W.D. Wallis, The existence of Room squares, Aequationes Math. 13 (1975), 1–7.
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Fuji-Hara, R., Vanstone, S.A. (1980). On automorphisms of doubly resolvable designs. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088897
Download citation
DOI: https://doi.org/10.1007/BFb0088897
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10254-0
Online ISBN: 978-3-540-38376-5
eBook Packages: Springer Book Archive