scientific article; zbMATH DE number 4006315

From MaRDI portal
Publication:3757947





Let A be an \(n\times n\) matrix. We denote by P a property which holds for some elements of A. For every \(i\in \{1,...,n\}\) we denote by \(L_ i\) the set of those indices \(j\in \{1,...,n\}\) for which \(a_{ij}\) verifies P (respectively, by \(T_ i\) we denote the set of those indices j for which \(a_{ji}\) verifies this property). Theorem: There are some permutations of the rows and/or the columns of the matrix A such that after these permutations only elements satisfying the property P occur on the main diagonal if and only if the Boolean equation: \[ (1)\quad \cup^{n}_{k=1}[\prod_{t\in L_ k}\bar x_{kt}\cup \cup_{i,j\in L_ k;p,q\in T_ k}(x_{ki}\cdot x_{kj}\cdot {\bar \delta}_{ij}\cup x_{pk}\cdot x_{qk}\cdot {\bar \delta}_{pq})]=0 \] is solvable in \(B_ 2\), the two element Boolean algebra, where \(\delta\) denotes Kronecker's symbol.











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 Q3757947)