Rank decomposability in incident spaces

DOI10.1016/0024-3795(93)00351-YzbMATH Open0840.15002WikidataQ126812396 ScholiaQ126812396MaRDI QIDQ1904043FDOQ1904043

Authors: Yanyan Li 

Publication date: 18 December 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Recommendations

• Rank decomposition under combinatorial constraints
• scientific article; zbMATH DE number 741201
• Large spaces of symmetric matrices of bounded rank are decomposable^∗
• Rank decompositions and signed bigraphs
• Skew rank decompositions

zbMATH Keywords

bipartite graphchordalincidence spacerank one matricesrank decomposable

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

• Schur products and matrix completions
• Title not available (Why is that?)
• Positive definite completions of partial Hermitian matrices
• Operators of Finite Rank in Nest Algebras
• The rank of a difference of matrices and associated generalized inverses
• Finite Rank Operators in Reflexive Operator Algebras
• Decomposability of Reflexive Cycle Algebras
• Rank decomposition under combinatorial constraints

Cited In (6)

• Matrix completions and chordal graphs
• Rank decomposition under combinatorial constraints
• Algebraic isomorphisms and $\mathcal {J}$-subspace lattices
• Research problem: The completion number of a graph
• Skew rank decompositions
• Title not available (Why is that?)

This page was built for publication: Rank decomposability in incident spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904043)