The base sets of primitive zero-symmetric sign pattern matrices (Q2469501)

Base sets of generalized sign pattern matrices are studied. The sign pattern of a real matrix \(A\) is the \((0, 1, -1)\)-matrix obtained from \(A\) by replacing each entry by its sign. When computing the entries of the power \(A^k\) an ``ambiguous sign'' denoted by \(\#\) may arise when a positive sign is added to a negative sign. Matrices with entries in the set \(\{0, 1, -1, \#\}\) are then called generalized sign pattern matrices. A square generalized sign pattern matrix \(A\) is called powerful if each power of \(A\) contains no \(\#\) entry. In the paper, the concept of the local base of generalized sign pattern matrices is introduced and an upper bound of the local base is given. Then, sharp upper bounds of the base sets are obtained. These base sets are determined and it is shown that there are no gaps in these base sets.