No label defined (Q3025281)

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 2187090
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2187090

      Statements

      0 references
      0 references
      0 references
      13 July 2005
      0 references
      permanent
      0 references
      binary matrix
      0 references
      The main result is that for any integers \(k,n\) satisfying \(1\leq k\leq 2^{n-1}\) there exists an \(n\times n\) binary matrix with permanent equal to \(k\). This result was first proved in 1965 by \textit{R. A. Brualdi} and \textit{M. Newman} [J. Res. Natl. Bur. Stand., Sect. B 69, 159-163 (1965; Zbl 0156.26503)]. This short note is blighted by errors and should not have been published. The bad English leaves the reader trying to guess what was intended and much of the mathematics is of a similar poor standard. I'll limit myself to two examples: Firstly, despite the authors' claim, their contraction operation does not preserve the permanent for matrices with more columns than rows. For example, contracting \[ \left(\begin{matrix} 1&0&0&1\\ 1&0&1&0\\ 0&1&0&0\\ \end{matrix}\right) \] on the first column gives \[ \left(\begin{matrix} 0&1&1\\ 1&0&0\\ \end{matrix}\right) \] and thereby reduces the permanent from 3 to 2. Secondly, Theorem 3 is worthless. It consists of an upper bound \(f(n)\) for a probability \(P_n\), but \(f(n)\) is greater than 1 except for the first few values of \(n\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references