Abstract

An n × n sign pattern matrix has entries in { + , - , 0 } . This paper surveys the following problems concerning spectral properties of sign pattern matrices: sign patterns that allow all possible spectra (spectrally arbitrary sign patterns); sign patterns that allow all inertias (inertially arbitrary sign patterns); sign patterns that allow nilpotency (potentially nilpotent sign patterns); and sign patterns that allow stability (potentially stable sign patterns). Relationships between these four classes of sign patterns are given, and several open problems are identified.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call