On the structure of regular pairwise balanced designs

Abstract In this paper we obtain determinantal conditions necessary for the existence of (r,λ)-designs. The work is based on a paper of Connor [2]. In [3] Deza establishes an inequality which must be satisfied by the column vectors of an equidistant code; or, equivalently, the block sizes in an (r,λ)-design. We obtain a generalization of this inequality.

[1]  Victor Klee,et al.  Experimental designs through level reduction of the d-dimensional cuboctahedron , 1972, Discret. Math..

[2]  Scott A. Vanstone,et al.  Embedding (r, 1)-designs in finite projective planes , 1977, Discret. Math..

[3]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[4]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory, Ser. A.

[5]  Ian F. Blake,et al.  The mathematical theory of coding , 1975 .

[6]  R. G. Stanton,et al.  Inductive Methods for Balanced Incomplete Block Designs , 1966 .

[7]  W. S. Connor.  On the Structure of Balanced Incomplete Block Designs , 1952 .

[8]  Jonathan I. Hall,et al.  Bounds for equidistant codes and partial projective planes , 1977, Discret. Math..

[9]  Michel Deza.  Une propriete extremale des plans projectifs finis dans une classe de codes equidistants , 1973, Discret. Math..

[10]  Richard M. Wilson,et al.  An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms , 1972, J. Comb. Theory, Ser. A.

[11]  Osvaldo Marrero,et al.  Modular Hadamard Matrices and Related Designs , 1973, J. Comb. Theory, Ser. A.

[12]  Kulendra N. Majumdar.  On some Theorems in Combinatorics Relating to Incomplete Block Designs , 1953 .

[13]  J. H. Lint.  Equidistant point sets , 1974 .

[14]  Jacobus H. van Lint.  A theorem on equidistant codes , 1973, Discret. Math..