Construction of nonconvertible \((0,1)\) matrices (Q2342353): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the Gibson barrier for the Pólya problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pólya convertibility problem for symmetric matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4184984 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of computing the permanent / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conversion of the Permanent into the Determinant / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relationship between determinants and permanents / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of convertible (0,1)-matrices / rank | |||
Normal rank |
Latest revision as of 01:17, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Construction of nonconvertible \((0,1)\) matrices |
scientific article |
Statements
Construction of nonconvertible \((0,1)\) matrices (English)
0 references
11 May 2015
0 references
The author solves the problem of the existence of nonconvertible \((0,1)\)-matrices. Let \(M_n(0,1)\) be the set of square \((0,1)\)-matrices of order \(n\) and \(SM_n(0,1)\) denotes the set of symmetric elements of \(M_n(0,1)\). A matrix \(A \in M_n(0,1)\) is said to be convertible if there is a matrix \(X \in M_n(\pm 1)\) such that \[ \mathrm{per}(A)=\det{(A \circ X)}, \] where \(\circ\) denotes the elementwise multiplication of matrices, and \(\mathrm{per}\) and \(\det\) are the permanent and the determinant of a square matrix, respectively. In a similar way, a matrix \(A \in SM_n(0,1)\) is said to be symmetrically convertible if there is a matrix \(X \in SM_n(\pm 1)\) such that \(\text{per}(A)=\det{(A \circ X)}\). A matrix \(A \in M_n(0,1)\) is said to be weakly symmetrically convertible if there is a matrix \(X \in SM_n(\pm 1)\) such that \(\text{per}(A)= \pm \det{(A \circ X)}\). In this manuscript, for every admissible pair \((n, \nu)\), where \(\nu\) denotes the number of ones in a matrix \(A \in M_n(0,1)\), the author constructs nonconvertible matrices in the set \(M_n(0,1)\), whose permanent differs from zero. In addition, nonconvertible symmetric matrices are constructed. On the other hand, the author claims that, for \((n, \nu)=(4, 11)\), every symmetric matrix is weakly symmetrically convertible. For the other values of the pair of parameters \((n, \nu)\), examples of matrices that are not weakly symmetrically convertible are presented.
0 references
(0,1)-matrix
0 references
determinant
0 references
permanent
0 references
convertible (0,1)-matrix
0 references
Hadamard product
0 references