Abstract
An m by n sign pattern A is an m by n matrix with entries in {+, −, 0}. The signpattern A requires a positive (resp. nonnegative) left inverse provided each real matrix with sign pattern A has a left inverse with all entries positive (resp. nonnegative). In this paper, necessary and sufficient conditions are given for a sign pattern to require a positive or nonnegative left inverse. It is also shown that for n ≥ 2, there are no square sign patterns of order n that require a positive (left) inverse, and that an n by n sign pattern requiring a nonnegative (left) inverse is permutationally equivalent to an upper triangular sign pattern with positive main diagonal entries and nonpositive off-diagonal entries.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
