scientific article; zbMATH DE number 17634
[For the entire collection see Zbl 0726.00015.] An \(n\times n\) (0,1)-matrix \(E\) is said to be convertible if it can be converted, by changing some of the 1's to -1's, into a matrix \(\hat E\), called a conversion of \(E\), such that \(\hbox{per }E=|\text{det}\hat E|\). It is the same to say that \(E\) can be obtained from a sign- nonsingular (0,1,-1)-matrix \(\hat E\) by changing the -1's into 1's. The convertible matrix \(E\) is said to be maximal if it is fully indecomposable (that is, not convertible to direct sum form by permuting rows and columns) and if no matrix obtained from \(E\) by replacing a 0 with a 1 is convertible. The authors first describe an algorithm, that avoids backtracking, for deciding when a given (0,1)-matrix \(E\) is convertible. A sequence of matrices \(A_ 0,A_ 1,\dots,A_ m\), starting with the unit matrix \(I_ n=A_ 0\) and ending with the given matrix \(E=A_ m\), is constructed according to certain rules. The success of the algorithm rests on the fact that, if \(A_ i\) and \(A_{i+1}\) are convertible, then any conversion \(\hat A_ i\) of \(A_ i\) can be extended to a conversion \(\hat A_{i+1}\) of \(A_{i+1}\). The authors also discuss in some detail the maximal convertible matrices, giving several methods for constructing them. They show (for example) that, if \(n\geq 4\), there are at least \(3n\) 1's in a maximal convertible \(n\times n\) matrix and than, if \(n\geq 5\) and equality holds, then there are exactly three 1's in each row and column. Amongst several conjectures put forward is the interesting one that the only maximal convertible matrix of order \(n\geq 5\) is the incidence matrix of the 7-point projective plane.
- scientific article; zbMATH DE number 913537
- A relation between the determinant and the permanent on singular matrices
- A note on sign-nonsingular matrices
- Permanents of matrices of signed ones
- On the nonsingularity of matrices with certain sign patterns
- On the Relation Between the Determinant and the Permanent on Symmetric Matrices
- On nonsingular sign regular matrices
- On maximal sign-nonsingular matrices
- Determinants and alternating sign matrices
- Sign determinancy in \(LU\) factorization of \(P\)-matrices
- Rectangular \(L\)-matrices
- Sign-central matrices
- Ray patterns of matrices and nonsingularity
- Uniformly one-connected matrices and their inverses
- Qualitative comparative statics and audits of model performance
- Sign determinancy in \(LU\) factorization of \(P\)-matrices
- On convertible complex matrices
- Full sign-invertibility and symplectic matrices
- Sign-nonsingular skew-symmetric matrices
- On the Gibson barrier for the Pólya problem
- Pólya convertibility problem for symmetric matrices
- A relation between the determinant and the permanent on singular matrices
- Arithmetic matrix operations that preserve conversion
- Construction of nonconvertible (0,1) matrices
- Nonsingular sign patterns and the orthogonal group
- Convertible, nearly decomposable, and nearly reducible matrices
- Converting immanants on singular symmetric matrices
- Classes of sign nonsingular matrices with a specified number of zero entries
- On maximal sign-nonsingular matrices
- Subspaces where an immanant is convertible into its conjugate∗
- Lower bounds for Pólya's problem on permanent
- Convertible and m-convertible matrices
- An identity between the determinant and the permanent of Hessenberg-type matrices
- On the Gibson bounds over finite fields.
- WEAK DIMENSION AND CHAIN-WEAK DIMENSION OF ORDERED SETS
- scientific article; zbMATH DE number 139933 (Why is no real title available?)
- scientific article; zbMATH DE number 1492813 (Why is no real title available?)
- On the Pólya conversion problem for permanents and determinants
- scientific article; zbMATH DE number 940679 (Why is no real title available?)
- On maximal convertible matrices
- scientific article; zbMATH DE number 913537 (Why is no real title available?)
- The sufficient condition of sign conversion for matrices over a finite field
- Conversion of the Permanent into the Determinant
- On the Pólya permanent problem over finite fields
- Robust economic models
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 Q3974962)