scientific article; zbMATH DE number 2187090
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\).
- Representing integers in the binary number system as permanents of certain matrices
- Permanents -- a concise survey
- scientific article; zbMATH DE number 3845766
- The permanent of 0-1 matrices and Kallman's algorithm
- On Minc's sixth Conjecture
- scientific article; zbMATH DE number 3946364
- An upper bound for the permanent of \((0,1)\)-matrices.
- Permanents of Hessenberg (0,1)-matrices
- The asymptotic behaviour of permanents of some (0, 1)-matrices
- Multidimensional permanents in enumeration problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025281)