Rational solutions of certain matrix equations (Q959869)

A sign pattern is a matrix whose elements are \(+\), \(-\) or \(0\). For a real matrix \(B\), sgn\((B)\) is the sign pattern obtained by replacing each positive, negative or zero element of \(B\) by \(+\), \(-\) or \(0\). For a given sign pattern \(A\), the sign pattern class of \(A\), denoted by \(Q(A)\), is the set \(\{B:\text{sgn}(B)=A\}\). The following theorem is proved: given a real matrix equation \(AB=C\) in which the zero bipartite graph of \(C\) is a forest, then there exist rational perturbations maintaining the same sign pattern classes of the original matrices, such that \(\widetilde A\widetilde B=\widetilde C\).