On Integer Matrices and Incidence Matrices of Certain Combinatorial Configurations, III: Rectangular Matrices

1966 ◽  
Vol 18 ◽  
pp. 9-17
Author(s):  
Kulendra N. Majindar
Keyword(s):  
Necessary Conditions ◽  
Block Designs ◽  
Incomplete Block ◽  
Incidence Matrices ◽  
Balanced Incomplete Block Designs ◽  
Balanced Incomplete Block ◽  
Definition Of ◽  
Combinatorial Configurations

In this paper, we give a connection between incidence matrices of affine resolvable balanced incomplete block designs and rectangular integer matrices subject to certain arithmetical conditions. The definition of these terms can be found in paper II of this series or in (2). For some necessary conditions on the parameters of affine resolvable balanced incomplete block designs and their properties see (2).

On Integer Matrices and Incidence Matrices of Certain Combinatorial Configurations, II: Rectangular Matrices

1966 ◽  
Vol 18 ◽  
pp. 6-8
Author(s):  
Kulendra N. Majindar
Keyword(s):  
Block Designs ◽  
Incomplete Block ◽  
Incidence Matrices ◽  
Balanced Incomplete Block Designs ◽  
Balanced Incomplete Block ◽  
Definition Of ◽  
Image Position ◽  
Combinatorial Configurations

In this paper we establish a connection between rectangular integer matrices and incidence matrices of resolvable balanced incomplete block designs. The definition of these terms has been given in paper I of this series.Our theorem can be stated as follows:THEOREM 2. Let A be a v X b matrix with integer elements such that2.1

scholarly journals Some new construction methods of variance balanced block designs with repeated blocks

2008 ◽  
Vol 5 (1) ◽  
Author(s):  
Bronisław Ceranka ◽  
Małgorzata Graczyk
Keyword(s):  
Block Designs ◽  
Incomplete Block ◽  
Incidence Matrices ◽  
Balanced Incomplete Block Designs ◽  
Construction Methods ◽  
New Construction ◽  
Balanced Incomplete Block

Some new construction methods of the variance balanced block designs with repeated blocks are given. They are based on the specialized product of incidence matrices of the balanced incomplete block designs.

Symmetric Conference Matrices of Order pq 2 + 1

1978 ◽  
Vol 30 (02) ◽  
pp. 321-331 ◽  
Author(s):  
Rudolf Mathon
Keyword(s):  
Hadamard Matrices ◽  
Orthogonality Condition ◽  
Block Designs ◽  
Incomplete Block ◽  
Balanced Incomplete Block Designs ◽  
Balanced Incomplete Block ◽  
Equiangular Lines ◽  
Combinatorial Configurations ◽  
Square Matrix

A conference matrix of order n is a square matrix C with zeros on the diagonal and ±1 elsewhere, which satisfies the orthogonality condition CCT = (n — 1)I. If in addition C is symmetric, C = CT, then its order n is congruent to 2 modulo 4 (see [5]). Symmetric conference matrices (C) are related to several important combinatorial configurations such as regular two-graphs, equiangular lines, Hadamard matrices and balanced incomplete block designs [1; 5; and 7, pp. 293-400]. We shall require several definitions.

scholarly journals ON D-OPTIMAL CHEMICAL BALANCE WEIGHING DESIGNS

2015 ◽  
Vol 1 (311) ◽  
Author(s):  
Bronisław Ceranka ◽  
Małgorzata Graczyk
Keyword(s):  
Optimal Design ◽  
Measurement Errors ◽  
Block Designs ◽  
Incomplete Block ◽  
Chemical Balance ◽  
Incidence Matrices ◽  
Balanced Incomplete Block Designs ◽  
Construction Methods ◽  
Existence Conditions ◽  
Balanced Incomplete Block

The paper deals with the problem of determining the chemical balance weighing designs satisfying the criterion of D-optimality under assumption that the measurement errors are equal correlated and they have the same variances. The existence conditions and the form of the optimal design are given. Moreover, some construction methods of the design matrices based on the incidence matrices of the balanced incomplete block designs and ternary balanced block designs are presented. Any example of construction is given.

scholarly journals On the relationship between graphs and partially balanced incomplete block designs

1969 ◽  
Vol 1 (3) ◽  
pp. 425-430 ◽  
Author(s):  
W.D. Wallis
Keyword(s):  
Necessary Conditions ◽  
Block Design ◽  
Block Designs ◽  
Incomplete Block ◽  
Balanced Incomplete Block Design ◽  
Balanced Design ◽  
Balanced Incomplete Block Designs ◽  
Incomplete Block Design ◽  
Balanced Incomplete Block ◽  
The Relationship

Certain theorems which are already known show that if a partially balanced incomplete block design with suitable parameters exists then there is a (V, K, Λ)-graph. We prove that the existence of such a graph is in fact equivalent to the existence of a certain partially balanced design. The known necessary conditions for (V, K, Λ)-graphs then follow from well-known necessary conditions for designs.

Combinatorial Problems

1950 ◽  
Vol 2 ◽  
pp. 93-99 ◽  
Author(s):  
S. Chowla ◽  
H. J. Ryser
Keyword(s):  
Combinatorial Problem ◽  
Difference Sets ◽  
Projective Planes ◽  
Combinatorial Problems ◽  
Block Designs ◽  
Incomplete Block ◽  
Incidence Matrices ◽  
Finite Projective Planes ◽  
Balanced Incomplete Block Designs ◽  
Balanced Incomplete Block

Let it be required to arrange v elements into v sets such that every set contains exactly k distinct elements and such that every pair of sets has exactly elements in common . This combinatorial problem is studied in conjunction with several similar problems, and these problems are proved impossible for an infinitude of v and k. An incidence matrix is associated with each of the combinatorial problems, and the problems are then studied almost entirely in terms of their incidence matrices. The techniques used are similar to those developed by Bruck and Ryser for finite projective planes [3]. The results obtained are of significance in the study of Hadamard matrices [6;8], finite projective planes [9], symmetrical balanced incomplete block designs [2; 5], and difference sets [7].

Sign in / Sign up

Export Citation Format

Share Document