scientific article; zbMATH DE number 1323403

From MaRDI portal
Publication:4255254





The authors study relations between properties of non-negative matrices and finite oriented graphs (quivers). Let \(\tau\) be a permutation of the numbers \(1,2,\ldots,n\) and let \(P_{\tau}= \sum_{i=1}^{n}e_{i\tau_{i}}\) be a permutation matrix, where \(e_{ij}\), \(i,j=\overline{1,n}\) are the matrix units. A square matrix \(B\) is called permutation reducible if there exists a permutation matrix \(P_{\tau}\) such that \[ P_{\tau}^{T}BP_{\tau}=\begin{pmatrix} B_1 & B_{12}\\ 0 & B_2\end{pmatrix}, \] where \(B_1\) and \(B_2\) are square matrices of order less than \(n\). Otherwise the matrix \(B\) is called permutation non-reducible. Using a square matrix \(B\) we construct simple quivers \(Q(B)\) in the following way: \(VQ=\{1,2,\ldots, n\}\), where \(VQ\) is a set of all nodes of \(Q(B)\), and in \(Q(B)\) exists an arrow from node \(k\) to node \(i\) if and only if \(b_{ki}\neq 0\). One of the results is the following. A square matrix \(B\) is permutation non-reducible if and only if the quiver \(Q(B)\) is strongly connected.











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