Papers
Topics
Authors
Recent
Search
2000 character limit reached

Affine subspace of matrices with constant rank

Published 29 Nov 2021 in math.RA | (2111.14997v2)

Abstract: For every $m,n \in \mathbb{N}$ and every field $K$, let $M(m \times n, K)$ be the vector space of the $(m \times n)$-matrices over $K$ and let $S(n,K)$ be the vector space of the symmetric $(n \times n)$-matrices over $K$. We say that an affine subspace $S$ of $M(m \times n, K)$ or of $S(n,K)$ has constant rank $r$ if every matrix of $S$ has rank $r$. 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}$$ $$aK(m \times n;r) = \max {\dim S \mid S \in {\cal A}K(m \times n; r ) }.$$ $$a{sym}K(n;r) = \max {\dim S \mid S \in {\cal A}{sym}K(n,r) }.$$ In this paper we prove the following two formulas for $r \leq m \leq n$: $$a{sym}{\mathbb{R}}(n;r) \leq \left\lfloor \frac{r}{2} \right\rfloor \left(n- \left\lfloor \frac{r}{2} \right\rfloor\right)$$ $$a{\mathbb{R}}(m \times n;r) = r(n-r)+ \frac{r(r-1)}{2} .$$

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.