Premium
Constructions for near resolvable designs and BIBDs
Author(s) -
van Trung Tran
Publication year - 1999
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1999)7:3<227::aid-jcd6>3.0.co;2-s
Subject(s) - mathematics , combinatorics , class (philosophy) , order (exchange) , construct (python library) , discrete mathematics , computer science , finance , artificial intelligence , economics , programming language
The purpose of this article is twofold. First, it is shown that classical inversive planes of even order can be used to construct a class of 2—(2 2 n + 1, 2 n , 2 n —1) near resolvable designs, in which any two blocks have at most 2 points in common. Secondly, it is shown that a recursive construction method for BIBDs using resolvable BIBDs due to Shrikhande and Raghavarao can be extended by using near resolvable designs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 227–231, 1999