Rank decomposability in incident spaces
Tools
Tools
Tools
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.
Free to read: http://dx.doi.org/10.1016/0024-3795(93)00351-Y
*No subscription required
*No subscription required
Abstract
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 |
| Publisher: | Elsevier |
| Copyright: | © 1995 Published by Elsevier Inc. |
| URI: | http://researchrepository.murdoch.edu.au/id/eprint/18478 |
 |
Item Control Page |
