On block designs with repeated blocks (Q1199619): Difference between revisions

This paper is concerned with balanced incomplete block designs in which repeated blocks are allowed. If \({\mathcal D}\) is such a \((v,k,\lambda)\)- design (using the standard notation), let \(b^*\) denote the number of distinct blocks. Let \(BIBD(v,k,\lambda| b^*)\) denote the family of all such designs \({\mathcal D}\). Fixing the number of points \(v\) and the block size \(k\) (but allowing \(\lambda\) to vary), consider the possible values \(b^*\) for which a \(BIBD(v,k,\lambda| b^*)\) exists, and let \(b^*_{\text{min}}\) be the minimum possible value. \textit{W. Foody} and \textit{A. Hedayat} [On theory and applications of \(BIB\) designs with repeated blocks, Ann. Stat. 5, 932-945 (1977; Zbl 0368.62054)] have shown that \(\left\lceil{v\over k}\left\lceil{v-1\over k-1}\right\rceil\right\rceil\leq b^*_{\text{min}}\leq{v\choose 2}\). Moreover, Hedayat posed the question of whether it is always possible to construct a \(BIBD(v,k,\lambda| b^*)\) with \(b^*={v\choose 2}\). It is presently known that \(b^*={v\choose 2}\) can be achieved when \(k=3\) and \(v\geq 7\). In the paper under review the author shows this can also be achieved for \(k=4\) and \(v\geq 7\). This is accomplished by recursive constructions based on mutually orthogonal Latin squares with common transversals. Some progress is also made on the case \(k>4\). In particular, the author points out that \(b^*={v\choose 2}\) can be achieved for any odd prime power \(v\equiv-1\pmod 4\) with \(3\leq k\leq v-3\) and for any odd prime \(v\) with \(3\leq k\leq v-2\).