Row Coincidences in Nonsingular Binary Matrices

Abstract

We present best possible bounds for the number of coincidences of ones between two distinct rows of a nonsingular binary matrix of constant row sum. The lower bound is shown best possible by examples. We construct two classes of matrices that show the upper bound is best possible. © 2001 Academic Press.