Resolvable x ω-bounded designs

Abstract

We investigate the existence of resolvable balanced incomplete block designs, RBIBDs, with the following property. Place the blocks of the RBIBD in a two-dimensional array with no empty cells such that the rows are the resolution classes. If every element appears at most ω times in each column we call the design resolvable x ω-bounded. We give recursive constructions for these designs for general block size and direct constructions for block sizes three and four.