Symmetric sign pattern matrices that require unique inertia (Q5955655): Difference between revisions

A matrix whose entries are from the set \(\{+,-,0\}\) is called a sign pattern matrix. The sign pattern matrix for a real matrix \(B\) is that one in which each positive (respectively, negative, zero) entry is replaced by + (respectively, \(-\), 0) and is denoted by \(\text{sgn}(B)\). The inertia of a real symmetric matrix \(B\) -- denoted by \(i(B)\) -- is a triple of integers that express the number of positive, negative and zero eigenvalues of a matrix \(B\). We say that a sign pattern matrix \(A\) requires unique inertia if \(i(B_1)=i(B_2)\) for all real symmetric matrices \(B_1, B_2\) for which \(\text{sgn}(B_1)= \text{sgn}(B_2)=A\). Various characteristics of symmetric sign pattern matrices that require unique inertia are presented. The relations to graphs representation are used.