Abstract
For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H.Bart, A.P.M.Wagelmans (2000). The proof involves elements from integer programming and employs Farkas’ lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred to above can be extended to other zero pattern matrix algebras. It is shown that such a generalization does indeed hold for certain digraphs determining the pattern of zeros. The digraphs in question can be characterized in terms of forests, i.e., disjoint unions of rooted trees.
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.
