Abstract

Characterization of sign patterns that allow diagonalizability has been a long-standing open problem. In this article, necessary and sufficient conditions for a sign pattern to allow diagonalizability are obtained, in terms of allowing related properties. Some properties of normal sign patterns are considered. In particular, it is shown that normal sign patterns of order up to 3 allow diagonalizability. Two combinatorial necessary conditions for a sign pattern to allow diagonalizability are also presented.

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