Research problem

From MaRDI portal





Let \(S(n,k)\) denote the set of \(n \times n\) zero-one matrices with \(k\) ones in each row and column. Let \((n,k)\) denote the greatest common divisor of \(n\) and \(k\). For each matrix \(A \in S(n,k)\), \(| A |\), the determinant of \(A\), is a multiple of \(k(n,k)\). Morris Newman formulated the following conjecture: if \(n>4\) and \(1\leq k \leq n-1\), then there exists a matrix \(A \in S(n,k)\) such that \(| A |=k(n,k)\). This article describes an unproved but highly successful algorithm for constructing such a matrix. The reader is challenged to supply a proof. Some properties of the algorithm are proved.











This page was built for publication: Research problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271069)