Learn More
Let A be a. matrix of m rows and n columns and let the entries of A be the integers 0 and 1. We call such a matrix a (0, 1) -matrix of size m by n. The 2 (0, 1)-matrices of size m by n play a fundamental role in a wide variety of combinatorial investigations. One of the chief reasons for this is the following. Let X be a set of n elements Xi, X2, • • • , xn(More)
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the(More)
Let X and Y be integral matrices of order 12 > 1 and suppose that these matrices satisfy the matrix equation XY = B, where B is a matrix with k in the n main diagonal positions and X and p in all other positions. Suppose further that k, A, and p are nonnegative integers and that X occurs exactly the same number of times in each line of B and that a similar(More)
x v) be a set of v elements (a v-set) and let X X9 X 29. .. 9 X v be subsets of X. These subsets of X are called a (v , k , \)-design provided : (1.1) Each X f is a ^-subset of X. (1.3) The integers v , k 9 and X satisfy 0<X<fc<v—1. Now let a tj = 1 if x f is a member of A^ and let ^ = 0 if x t is not a member of X,. Then (1.4) A=[ ai} ] is a (0,l)-matrix(More)