Translator Disclaimer
January, 1973 On $\mu$-Resolvable and Affine $\mu$-Resolvable Balanced Incomplete Block Designs
Sanpei Kageyama
Ann. Statist. 1(1): 195-203 (January, 1973). DOI: 10.1214/aos/1193342400

Abstract

The concept of resolvability and affine resolvability was generalized to $\mu$-resolvability and affine $\mu$-resolvability by Shrikhande and Raghavarao (1964). In this paper, a representation of parameters of an affine $\mu$-resolvable BIB design is given and necessary conditions for the existence of this design are derived. Some methods of constructing (affine) $\mu$-resolvable BIB designs are given and some inequalities for these designs are obtained. Finally, some information on the block structure of $\mu$-resolvable BIB designs is provided.

Citation

Download Citation

Sanpei Kageyama. "On $\mu$-Resolvable and Affine $\mu$-Resolvable Balanced Incomplete Block Designs." Ann. Statist. 1 (1) 195 - 203, January, 1973. https://doi.org/10.1214/aos/1193342400

Information

Published: January, 1973
First available in Project Euclid: 25 October 2007

zbMATH: 0253.62036
MathSciNet: MR359204
Digital Object Identifier: 10.1214/aos/1193342400

Rights: Copyright © 1973 Institute of Mathematical Statistics

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.1 • No. 1 • January, 1973
Back to Top