Bounds for the Number of Common Treatments Between Any Two Blocks of Certain PBIB Designs
Shah, S. M.
Ann. Math. Statist., Tome 36 (1965) no. 6, p. 337-342 / Harvested from Project Euclid
In an earlier paper [4], the author has given upper bounds for the number of disjoint blocks in (i) Semi-regular GD designs, (ii) certain PBIB designs with two associate classes having triangular association scheme, (iii) certain PBIB designs with two associate classes having $L_2$ association scheme and (iv) certain PBIB designs with three associate classes having rectangular association scheme. In this paper, we give bounds for the number of common treatments between any two blocks of the above-mentioned PBIB designs. The main tools used to establish the results of this paper are the theorems proved by (i) Bose and Connor [1], (ii) Raghavarao [3], and (iii) Vartak [6].
Publié le : 1965-02-14
Classification: 
@article{1177700299,
     author = {Shah, S. M.},
     title = {Bounds for the Number of Common Treatments Between Any Two Blocks of Certain PBIB Designs},
     journal = {Ann. Math. Statist.},
     volume = {36},
     number = {6},
     year = {1965},
     pages = { 337-342},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1177700299}
}
Shah, S. M. Bounds for the Number of Common Treatments Between Any Two Blocks of Certain PBIB Designs. Ann. Math. Statist., Tome 36 (1965) no. 6, pp.  337-342. http://gdmltest.u-ga.fr/item/1177700299/