Rank decomposability in incident spaces

DOI10.1016/0024-3795(93)00351-YMaRDI QIDQ1904043zbMATH OpenWikidataFDO

Authors Yanyan Li

Publication date 18 December 1995

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

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)

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

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Decomposability of Reflexive Cycle Algebras
• Finite Rank Operators in Reflexive Operator Algebras
• Operators of Finite Rank in Nest Algebras
• Positive definite completions of partial Hermitian matrices
• Rank decomposition under combinatorial constraints
• Schur products and matrix completions
• The rank of a difference of matrices and associated generalized inverses

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
• scientific article; zbMATH DE number 741201 (Why is no real title available?)

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)