A level matrix is a matrix with 0/1-entries (binary) such that the sum of the entries (or weight) in each of its columns is a constant d. An irreducible matrix is a level matrix such that no proper subset of its rows form a level matrix. In this talk, we will discuss the properties of irreducible matrices and their connections to well-known concepts in discrete mathematics.
This is a joint work with El-Zanati, Seelinger, Spence, Vanden Eynden.