Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
DOI10.1016/j.laa.2021.03.010zbMath1464.15002OpenAlexW3134624588MaRDI QIDQ2020704
Torsten Ehrhardt, Bernd Silbermann, Harm Bart
Publication date: 24 April 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.03.010
integer programmingadditive decompositionrank constraints\(\mathsf{L}\)-free graphblock (upper triangular) matricesdirected (bipartite) graphzero pattern constraints
Partial orders, general (06A06) Integer programming (90C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21)
Related Items
Cites Work
- Sums of idempotents and logarithmic residues in zero pattern matrix algebras
- Logarithmic residues, Rouché's theorem, and spectral regularity: The \(C^{\ast}\)-algebra case
- N-free posets as generalizations of series-parallel posets
- A structure theorem for some matrix algebras
- Logarithmic residues in Banach algebras
- Logarithmic residues, generalized idempotents, and sums of idempotents in Banach algebras
- An integer programming problem and rank decomposition of block upper triangular matrices
- L-free directed bipartite graphs and echelon-type canonical forms
- How small can a sum of idempotents be?
- A partial order that is not rank/trace complete
- Unions of rank/trace complete preorders
- Sums of idempotent matrices
- Rank decomposition in zero pattern matrix algebras
- When is a matrix a sum of idempotents?
- Echelon Type Canonical Forms in Upper Triangular Matrix Algebras
- Algebras defined by patterns of zeros
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
