Some properties on resolvability of variance-balanced designs
type: Item
instance of: scholarly article
title: Some properties on resolvability of variance-balanced designs
zbMATH Open document ID: 0537.05005
DOI: 10.1007/BF00147652
author: Sanpei Kageyama
published in: Geometriae Dedicata
publication date: 1984-01-01T00:00:00Z
review text: In a \((\mu_ 1,\mu_ 2,...,\mu_ t)\)-resolvable block design, the b blocks can be divided into t sets of \(m_ i\) blocks each such that the set of \(m_ i\) blocks contains each of the v treatments exactly \(\mu_ i\) times \((i=1,2,...,t)\). A block design is known to be variance balanced if its usual C-matrix is a completely symmetric matrix \(\lambda\). It is shown that \(b\geq v+t-1\) for a \((\mu_ 1,\mu_ 2,...,\mu_ t)\)- resolvable, variance balanced design and properties of such designs are investigated when the lower bound for b is attained.
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05B20
Mathematics Subject Classification ID: 62K10
zbMATH DE Number: 3853083
zbMATH Keywords: variance-balanced block design
zbMATH Keywords: incidence matrix
zbMATH Keywords: \(\mu\)-resolvable BIB designs
reviewed by: D. Raghavarao
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00147652
OpenAlex ID: W2080787393
description: scientific article; zbMATH DE number 3853083