Construction of neighbor designs with v=2m
by
Nutan S. Mishra
Department of Mathematics and Statistics, University of South Alabama, Mobile, USA

Rees neighbor designs with complete binary blocks can also be seen as solutions to children’s round dance problems with v=k=2m+1 in m blocks. Obviously such designs could be constructed only for odd number of treatments. In the present article we discuss the existence and construction of neighbor designs with v=2m and with binary and incomplete blocks with no restriction on the number of blocks. In this article proper neighbor designs and proper generalized neighbor designs are constructed from the existing BIB designs, from existing PBIB designs , using four different methods namely by creating the base blocks, by rearranging the base blocks, by rearranging the treatments within blocks of the design and by composition of two designs.

Keywords: binary designs, proper designs, BIB designs, PBIB designs, Group Divisible PBIB designs.

Date received: July 21, 2004