Rank decomposition in zero pattern matrix algebras
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.
|Keywords||additive decomposition, block upper triangularity, Hasse diagram, in-tree, out-tree, partial order, preorder, rank constraints, rooted tree, zero pattern matrix algebra|
|Persistent URL||dx.doi.org/10.1007/s10587-016-0305-7, hdl.handle.net/1765/93701|
|Journal||Czechoslovak Mathematical Journal|
Bart, H, Ehrhardt, T, & Silbermann, B. (2016). Rank decomposition in zero pattern matrix algebras. Czechoslovak Mathematical Journal, 66(3), 987–1005. doi:10.1007/s10587-016-0305-7