Maximal rank in matrix spaces via graph matchings
Combinatorics
2017-03-17 v1
Abstract
We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in terms of their maximal rank.
Keywords
Cite
@article{arxiv.1703.05551,
title = {Maximal rank in matrix spaces via graph matchings},
author = {Roy Meshulam},
journal= {arXiv preprint arXiv:1703.05551},
year = {2017}
}
Comments
10 pages