Rank decomposability in incident spaces
Davidson, K.R., Harrison, K.J. and Mueller, U.A. (1995) Rank decomposability in incident spaces. Linear Algebra and its Applications, 230 . pp. 3-19.
*No subscription required
A set of matrices M is rank decomposable if each matrix T in M is the sum of r rank one matrices in M, where r is the rank of T. We show that an incidence space, i.e. the set of matrices supported on a given pattern, is rank decomposable if and only if the bipartite graph associated with the pattern is chordal.
|Publication Type:||Journal Article|
|Murdoch Affiliation:||School of Mathematical and Physical Sciences|
|Copyright:||© 1995 Published by Elsevier Inc.|
|Item Control Page|