Some sign patterns that allow a real inverse pair \(B\) and \(B^{-1}\) (Q676033)

A sign pattern matrix is a matrix whose entries are from the set \(\{+,-,0\}\). For a real matrix \(B\), let \(\text{sgn }B\) be the sign pattern matrix in which each positive (respectively, negative, zero) entry is replaced by \(+\) (respectively, \(-\), \(0\)). If \(A\) is an \(n\)-by-\(n\) sign pattern matrix, then the sign pattern class of \(A\) is defined by \(Q(A)=\{B\in M_n(R)\mid\text{sgn} B A\}\). The authors investigate patterns for which there exists a nonsingular \(B\in Q(A)\) such that \(B^{-1}\in Q(A)\). To this end, they establish global necessary conditions, obtain necessary and sufficient conditions for certain classes of patterns, and provide several construction algorithms to obtain classes of patterns that have the inverse pair property. Many illustrative examples and an interesting question for future research are presented.