Abstract
In [J.Y. Shao, L.H. You, Bound on the base of irreducible generalized sign pattern matrices, Discrete Math., in press], Shao and You extended the concept of the base from powerful sign pattern matrices to non-powerful (and generalized) sign pattern matrices. In this paper, we study the base for primitive non-powerful nearly reducible sign pattern (and generalized sign pattern) matrices. We obtain sharp upper bounds, together with complete characterization of the equality cases of the base for primitive nearly reducible sign pattern (and generalized sign pattern) matrices. We also show that there exist “gaps” in the base set of the classes of such matrices.
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.
