Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T10:32:15.617Z Has data issue: false hasContentIssue false

Block Sizes in Pairwise Balanced Designs

Published online by Cambridge University Press:  20 November 2018

Charles J. Colbourn
Affiliation:
Department of Computational Science, University of Saskatchewan, Saskatoon, Saskatchewan S7N 0W0, Canada
Kevin T. Phelps
Affiliation:
School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, U.S.A.
Vojtěch Rödl
Affiliation:
FJFI, CVUT, Husova 5, Praha 1, Czechoslovakia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The number of sets of integers which are realizable as block sizes of a pairwise balanced design of order n is between and ; in contrast, when the multiplicity of each block size is also specified, the number of multisets which can be realized is between and . Although this gives a reasonable bound on the number of multisets which can be realized, a good characterization is not likely to exist; deciding whether a multiset can be so realized is NP-complete.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1984