Research problem (Q4271069)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 459142
Language Label Description Also known as
default for all languages
No label defined
    English
    Research problem
    scientific article; zbMATH DE number 459142

      Statements

      Research problem (English)
      0 references
      9 January 1994
      0 references
      combinatorial matrices
      0 references
      minimal non-zero determinant
      0 references
      zero-one matrices
      0 references
      algorithm
      0 references
      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.
      0 references

      Identifiers