Sign-patterns which require a positive eigenvalue
Sign-patterns which require a positive eigenvalue
We investigate matrices which have a positive eigenvalue by virtue of their sign-pattern and regardless of the magnitudes of the entries. When all the off-diagonal entries are nonzero, we show that an n× nsign-patternn≠3,4, requires a positive eigenvalue if and only if it has at least one nonnegative diagonal …