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.
Similar content being viewed by others
References
H. Bart, T. Ehrhardt, B. Silbermann: Echelon type canonical forms in upper triangular matrix algebras. To appear in Oper. Theory, Adv. Appl.
H. Bart, T. Ehrhardt, B. Silbermann: Sums of idempotents and logarithmic residues in zero pattern matrix algebras. Linear Algebra Appl. 498 (2016), 262–316.
H. Bart, T. Ehrhardt, B. Silbermann: Sums of idempotents and logarithmic residues in matrix algebras. Operator Theory and Analysis. The M. A. Kaashoek Anniversary Volume (Bart, H. et al. eds.), Oper. Theory, Adv. Appl. 122 (2001), 139–168.
H. Bart, T. Ehrhardt, B. Silbermann: Logarithmic residues in Banach algebras. Integral Equations Oper. Theory 19 (1994), 135–152.
H. Bart, A. P. M. Wagelmans: An integer programming problem and rank decomposition of block upper triangular matrices. Linear Algebra Appl. 305 (2000), 107–129.
G. Birkhoff: Lattice Theory. Colloquium Publications Vol. 25, American Mathematical Society, Providence, 1967.
R. L. Davis: Algebras defined by patterns of zeros. J. Comb. Theory 9 (1970), 257–260.
S.-C. Fang, S. Puthenpura: Linear Optimization and Extensions: Theory and Algorithms. Prentice-Hall, Englewood Cliffs, 1993.
F. Harary: Graph Theory. Addison-Wesley Series in Mathematics, Reading, Mass., Addison Wesley Publishing Company, 1969.
T. J. Laffey: A structure theorem for some matrix algebras. Linear Algebra Appl. 162–164 (1992), 205–215.
C. H. Papadimitriou, K. Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, 1982.
A. Schrijver: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, Chichester, 1986.
E. Szpilrajn: Sur l’extension de l’ordre partiel. Fundamenta Mathematicae 16 (1930), 386–389 (In French.); available at http://matwbn. icm. edu. pl/ksiazki/fm/fm16/fm16125.pdf.
Author information
Authors and Affiliations
Corresponding author
Additional information
In thankful memory of Miroslav Fiedler
Rights and permissions
About this article
Cite this article
Bart, H., Ehrhardt, T. & Silbermann, B. Rank decomposition in zero pattern matrix algebras. Czech Math J 66, 987–1005 (2016). https://doi.org/10.1007/s10587-016-0305-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10587-016-0305-7
Keywords
- block upper triangularity
- additive decomposition
- rank constraints
- zero pattern matrix algebra
- preorder
- partial order
- Hasse diagram
- rooted tree
- out-tree
- in-tree