Sign patterns that require real, nonreal or pure imaginary eigenvalues

From MaRDI portal





A matrix whose entries consist of the symbols \(+,-\) and 0 is called a sign pattern matrix. For each \(n\times n\) sign pattern matrix \(A\) there is a natural class \(Q(A)\) of real matrices defined by \(Q(A)=\{B\in M_ n(R)|\text{sgn} b_{ij}=a_{ij}\) for all \(i,j\in\{1,\dots,n\}\}\). Let \(P\) be a property which real matrix may or may not have. A sign pattern matrix \(A\) is said to require \(P\) if every matrix in \(Q(A)\) has property \(P\), or to allow \(P\) if some matrix in \(Q(A)\) has property \(P\). In the paper sign pattern matrices with the following qualitative questions: ``requires all pure imaginary eigenvalues, ``requires all nonreal eigenvalues, ``requires all real eigenvalues, ``allows a real eigenvalue are characterized.




Cited in
(31)








This page was built for publication: Sign patterns that require real, nonreal or pure imaginary eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978383)