Please enter verification code
Construction of Some Resolvable t-designs
Science Journal of Applied Mathematics and Statistics
Volume 5, Issue 1, February 2017, Pages: 49-53
Received: Jul. 20, 2016; Accepted: Aug. 8, 2016; Published: Feb. 22, 2017
Views 3201      Downloads 112
Alilah David, Department of Mathematics, Masinde Muliro University of Science and Technology, Nairobi, Kenya
Article Tools
Follow on us
The A t-design is a generation of balanced incomplete block design (BIBD) where λ is not restricted to the blocks in which a pair of treatments occurs but to the number of blocks in which any t treatments (t = 2,3…) occurs. The problem of finding all parameters (t, v, k, λt) for which t-(v, k, λt) design exists is a long standing unsolved problem especially with λ=1 (Steiner System) as no Steiner t-designs are known for t ≥ 6 when v > k. In this study t-design is constructed by relating known BIB designs, combinatorial designs and algebraic structures with t-designs. Additionally, an alternative approach for the construction of t-designs that provides a unified framework is also presented.
Block Designs, Resolvable Designs, t-designs
To cite this article
Alilah David, Construction of Some Resolvable t-designs, Science Journal of Applied Mathematics and Statistics. Vol. 5, No. 1, 2017, pp. 49-53. doi: 10.11648/j.sjams.20170501.17
Copyright © 2017 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License ( which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Adhikari, B. (1967). On the symmetric differences of pairs of blocks of incomplete blockdesigns, Calcutta stat. Assoc. Bull 16, 45-48.
Blanchard, J. (1995a). A construction for Steiner 3-designs, Journal of combinatorialTheory A, 71, 60-67.
Blanchard, J. (1995c). A construction for orthogonal arrays with strength t ≥ 3, Discretemath 137, no. 1-3, 35-44.
Cameron, P., Maimani, H. R., Omidi, G. R., and Tayfeh-Rezaie, B. (2006). 3-designs PGL(2, q), Discrete Mathematics, 306, vol.23, 3063-3073.
Colbourn, C. (2002). Orthogonal arrays of strength three from regular 3-wise balanceddesigns.
Hartman, A. (1994). The fundamental construction for 3-designs. Discrete math 124, no. 1-3, 107-131.
Kageyama, S. (1991). A property of t-wise balanced designs, Ars. Combinatorial, 31, pp 237-238.
Mathon, R. and Rosa,A.(1985). Tables of paramenters of BIBds with r ≤ 41 includingexistence, enumeration and resolvability results. Annals of Discretemathematics 26, 275-308.
Mcsorley, J., and Soicher, L. (2005). Construction of t-designs from a t-wise balanceddesign, Eur. J. appear.
Mohácsy, H., and Ray-Chaudhuri, D. (2001). A construction for infinite families ofSteiner 3-designs, Journal of Combinatorial Theory A, 94, 127-141.
Mohácsy, H., and Ray-Chaudhuri, D. (2002). Candelabra Systems and designs, Journal ofStatistical planning and Inference, 106, 419-448.
Mohácsy, H., and Ray-Chaudhuri, D. (2003). A construction for group divisible t-designswith strength t ≥ 2 and index unity, Journal of Statistical planning and Inference, 109, 167-177.
Onyango, O. (2010). Construction of t-(v, k, λt) designs, Journal of mathematicalscience, vol. 21 no. 4 pp 521-526.
Ray-Chaudhuri, D. and Wilson, R. (1975). “On t-designs”, Osaka, J. Math, 12, 737-744.
Stinson, D. (2004). Combinatorial Designs: Construction and Analysis, Springer_Verlag,New York, Inc., New York.
Wilson, R (1972a). An existence theory for pairwise balanced designs I. Compositiontheorems and Morphisms, Journal of Combinatorial Theory A, 13, 220-245.
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
Tel: (001)347-983-5186