Maximal rank in matrix spaces via graph matchings
classification
🧮 math.CO
keywords
maximalranksubspacestermsaffinealternatingapplicationsassociated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.