Some properties of matrices from certain binary mathematical programming problems

It is shown that if a feasible solution to a binary mathematical programming problem is represented as an N × N matrix consisting of zeroes and ones, where there exists a single one in each row, then this matrix is periodic. From this result, it is proved that the eigenvalues of the constraint matrix are the N roots of unity.