AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of order n ⩾ 3 that satisfies the matrix equation ATA = D + [λiλj] where AT denotes the transpose of A, D denotes the diagonal matrix D = diag[k1 − λ1, k2 − λ2, …, kn − λn] and the scalars ki − λi and λj are positive. We call these configurations multiplicative designs. They are a natural generalization of the classical symmetric block designs and the recently investigated λ-designs. We develop certain basic properties of multiplicative designs. But the complete structure of these interesting configurations is far from determined
AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain...
AbstractWe present two new constructions of group divisible designs. We use skew-symmetric Hadamard ...
AbstractWe point out a generalization of the matrix equation NNT=(r− λ)I+λJ to t-designs with t>2 an...
AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of ...
This thesis deals with two problems. The first is the determination of λ-designs, combinatorial conf...
AbstractWe continue the study of multiplicative designs concentrating primarily on uniform, normal d...
AbstractWe establish, among other things, a family of symmetric block designs with parameters (v, k,...
AbstractThe first infinite families of symmetric designs were obtained from finite projective geomet...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
AbstractLet X and Y be integral matrices of order n > 1 and suppose that these matrices satisfy the ...
AbstractA construction is given of a family of symmetric block designs with parameters v = n3 + n + ...
AbstractThe incidence matrix of a (υ, k, λ)-design is a (0, 1)-matrix A of order υ that satisfies th...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
A multiplicative design is a square design (that is, a set S of n elements called varieties, and a c...
AbstractA λ-design as introduced by Ryser [3] is a (0, 1)-square matrix with constant column inner p...
AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain...
AbstractWe present two new constructions of group divisible designs. We use skew-symmetric Hadamard ...
AbstractWe point out a generalization of the matrix equation NNT=(r− λ)I+λJ to t-designs with t>2 an...
AbstractIn this paper we study combinatorial designs that are characterized by a (0, 1)-matrix A of ...
This thesis deals with two problems. The first is the determination of λ-designs, combinatorial conf...
AbstractWe continue the study of multiplicative designs concentrating primarily on uniform, normal d...
AbstractWe establish, among other things, a family of symmetric block designs with parameters (v, k,...
AbstractThe first infinite families of symmetric designs were obtained from finite projective geomet...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
AbstractLet X and Y be integral matrices of order n > 1 and suppose that these matrices satisfy the ...
AbstractA construction is given of a family of symmetric block designs with parameters v = n3 + n + ...
AbstractThe incidence matrix of a (υ, k, λ)-design is a (0, 1)-matrix A of order υ that satisfies th...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
A multiplicative design is a square design (that is, a set S of n elements called varieties, and a c...
AbstractA λ-design as introduced by Ryser [3] is a (0, 1)-square matrix with constant column inner p...
AbstractUsing matrix theoretic methods, bounds are obtained on the number of replications in certain...
AbstractWe present two new constructions of group divisible designs. We use skew-symmetric Hadamard ...
AbstractWe point out a generalization of the matrix equation NNT=(r− λ)I+λJ to t-designs with t>2 an...