Affine subspaces of matrices with rank in a range (Q6628868)

The paper concerns the problem of finding the maximal dimension of a linear or affine subspace of matrices whose rank is fixed. This issue has some connections with algebraic geometry and coding theory. The author investigates the maximal dimensions of various affine spaces of \(m\times n\) matrices over a field \(K\), whose ranks are between \(s\) and \(r\) (\(s\leqslant r\leqslant \min\left\{m,n\right\}\)). In particular, she proves that if characteristic of \(K\) is different than \(2\) and \(|K|\geqslant r+2\), then the desired maximal dimension is equal to \(r\cdot\max\left\{m,n\right\}-\binom{s+1}{2}\).