General upper bound for the number of blocks having a given number of treatments common with a given block |
| |
Authors: | Sanpei Kageyama Takumi Tsuji |
| |
Affiliation: | Hiroshima University, Hiroshima, Japan |
| |
Abstract: | The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations. |
| |
Keywords: | Connected PBIB design BIB design Spectral decomposition Association scheme α -resolvability Affine α -resolvability |
本文献已被 ScienceDirect 等数据库收录! |