Forty-three balanced incomplete block designs
type: Item
instance of: scholarly article
title: Forty-three balanced incomplete block designs
zbMATH Open document ID: 0798.05006
DOI: 10.1016/0097-3165(94)90023-X
published in: Journal of Combinatorial Theory. Series A
publication date: 1994-04-19T00:00:00Z
review text: A balanced incomplete block design (BIBD) with parameters \((v,b,r,k,\lambda)\) consists of a \(v\)-set \(S\) plus \(b\) \(k\)-element subsets of \(S\) called blocks satisfying the following conditions: (1.1) Every element of \(S\) appears in \(r\) blocks. (1.2) Any two distinct elements of \(S\) appear together in \(\lambda\) blocks. A resolvable BIBD is one whose blocks can be partitioned into \(r\) mutually disjoint resolution classes of size \(b/r\). Almost all of the forty-three new BIBDs presented in this paper are obtained by direct constructions via difference methods; many are addenda to the list compiled by \textit{R. Mathon} and \textit{A. Rosa} [Ars Comb. 30, 65-96 (1990; Zbl 0734.05012)].
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 554400
zbMATH Keywords: balanced incomplete block design
zbMATH Keywords: resolvable BIBD
author: R. Julian R. Abel
reviewed by: M.Oravas
MaRDI profile type: Publication
cites work: Q4262992
cites work: Q5461422
cites work: Balanced incomplete block designs and related designs
cites work: BIBD's with block-size seven
cites work: On the existence of small quasimultiples of affine and projective planes of arbitrary order
cites work: Q3360867
cites work: On the (15,5,\(\lambda\) )-family of BIBDs
cites work: Maximal arcs and related designs
description: scientific article; zbMATH DE number 554400