Affine subspace of matrices with constant rank
Elena Rubei

TL;DR
This paper characterizes the maximum dimensions of affine subspaces of matrices with constant rank, providing explicit formulas for symmetric and general matrices over the real numbers.
Contribution
It derives exact formulas for the maximum dimension of affine subspaces of matrices with constant rank, including symmetric cases, over the real numbers.
Findings
Maximum dimension of affine subspaces of matrices with constant rank over real numbers.
Explicit formula for the maximum dimension in the general case: r(n−r)+r(r−1)/2.
Upper bound for symmetric matrices: floor(r/2)*(n−floor(r/2)).
Abstract
For every and every field , let be the vector space of the -matrices over and let be the vector space of the symmetric -matrices over . We say that an affine subspace of or of has constant rank if every matrix of has rank . Define {\cal A}^K(m \times n; r)= \{ S \;| \; S \; \mbox{\rm affine subsapce of $M(m \times n, K)$ of constant rank } r\} {\cal A}_{sym}^K(n;r)= \{ S \;| \; S \; \mbox{\rm affine subsapce of $S(n,K)$ of constant rank } r\} In this paper we prove the following two formulas for : $$a_{sym}^{\mathbb{R}}(n;r) \leq \left\lfloor \frac{r}{2} \right\rfloor \left(n-…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · graph theory and CDMA systems · Matrix Theory and Algorithms
