ON THE PERIOD AND BASE OF A SIGN PATTERN MATRIX

A square sign pattern matrix A (whose entries are +, -, or 0) is said to be powerful if all the powers A(1), A(2), A(3),..., are unambiguous ly defined. For a powerful pattern A, if A(l) = A(l+p) with l and p mi nimal, then l is called the base of A and p is called the period of A. We characterize irreducible powerful sign pattern matrices and invest igate the period and base of a powerful sign pattern matrix. We also c onsider some connections with real matrices and give some significant classes of powerful patterns.