Potentially eventually exponentially positive sign patterns (Q381170): Difference between revisions

A matrix \(A\in\mathbb{R}^{n\times n}\) is eventually positive (EP) if for \(k\) large enough \(A^k>0\) and eventually exponentially positive (EEP) if \(\exp(tA)>0\) for \(t\) large enough (inequalities entrywise). A sign pattern of the matrix \(A\) is \(\mathrm{sgn}(A)\) where the sign is taken entrywise. A sign pattern is called potentially (exponentially) eventually positive (P(E)EP) if there is a matrix with that sign pattern that is (E)EP. This paper gives several results on PEEP patterns. For example, characterizing patterns as PEEP when they have certain properties. Also, properties are given for the right-most eigenvalue of a matrix whose sign pattern is PEEP. The minimum number of positive entries in a PEEP pattern is still an open problem but it is shown that it cannot be greater than \(n\). A complete classification of sign patterns of size \(2\times 2\) and \(3\times 3\) is included.