The generating set of Z n is determined completely for n 8, with the exception of the (46,6,1) design. Some general results are presented for larger values of n. 1 Introduction A pairwise balanced design (or PBD) is a pair (V ,B) where 1. V is a finite set of points, 2. B is a collection of subsets of V called blocks, 3. every pair of distinct points of V occur in exactly one blocks. We use the notation PBD(v;K) when jV j = v and jBj 2 K for all B 2 B. We denote B(K)=fv : there exists a PBD(v,K)g. A set S of positive integers is PBD-closed if the existence of a PBD(v;S) implies that v belongs to S. Let K be a PBD-closed set. Let G be a set of positive integers such that K = B(G). Then G is a generating set for K. Let K be a PBD-closed ...
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design,...
The spectrum of orthogonal group divisible designs with block size three, and u groups each of size ...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, a...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
This is a preprint of an article published in Utilitas Mathematica, 58, 2000, p97-107, c©2000 (copyr...
AbstractA block, considered as a set of elements together with its adjacency matrix M, is called a B...
AbstractGiven positive integers k and λ, balanced incomplete block designs on v points with block si...
AbstractA proper PBD(L, v) is a pairwise balanced design (with λ = 1) on v points whose line sizes a...
The quantity $g^{(k)}(v)$ is the minimum number of blocks necessary in a pairwise balanced design on...
AbstractWe describe a method used to prove nonexistence of pairwise balanced designs and determine t...
AbstractWe show that if a pairwise balanced design with λ = 1 has ν objects and block sizes between ...
This thesis presents the applications of Combinatorics in a Balanced Incomplete Block Design (B.I.B....
AbstractThe pair (P, p) is a (partial) (n, b)-PBD if (P, p) isa (partial) pairwise balanced design w...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design,...
The spectrum of orthogonal group divisible designs with block size three, and u groups each of size ...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, a...
AbstractThis paper deals with existence results for pairwise balanced designs with block sizes 8, 9,...
This is a preprint of an article published in Utilitas Mathematica, 58, 2000, p97-107, c©2000 (copyr...
AbstractA block, considered as a set of elements together with its adjacency matrix M, is called a B...
AbstractGiven positive integers k and λ, balanced incomplete block designs on v points with block si...
AbstractA proper PBD(L, v) is a pairwise balanced design (with λ = 1) on v points whose line sizes a...
The quantity $g^{(k)}(v)$ is the minimum number of blocks necessary in a pairwise balanced design on...
AbstractWe describe a method used to prove nonexistence of pairwise balanced designs and determine t...
AbstractWe show that if a pairwise balanced design with λ = 1 has ν objects and block sizes between ...
This thesis presents the applications of Combinatorics in a Balanced Incomplete Block Design (B.I.B....
AbstractThe pair (P, p) is a (partial) (n, b)-PBD if (P, p) isa (partial) pairwise balanced design w...
AbstractA mandatory representation design MR(K; v) is a pairwise balanced design on v points with bl...
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design,...
The spectrum of orthogonal group divisible designs with block size three, and u groups each of size ...
Let N(t; v; k; ) be the maximum possible number of mutually disjoint cyclic t- (v; k; ) designs. In...