Papers
Topics
Authors
Recent
Search
2000 character limit reached

Affine subspaces of matrices with rank in a range

Published 7 May 2024 in math.RA | (2405.04694v3)

Abstract: The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught also the attention of algebraic geometers since vector spaces of matrices of constant rank $r$ give rise to vector bundle maps whose images are vector bundles of rank $r$. Moreover there is a link with the so called ``rank metric codes'', since a constant rank $r$ subspace of $K{n \times n}$ can be viewed as a constant weight $r$ rank metric code; it can be interesting to study also the maximal dimension of the subspaces of $K{n \times n}$ whose elements have rank in a range $[s,r]$, since such subspaces obviously give rank metric codes with weights in $[s,r]$. In this paper, with the main purpose to get an organic result including the ones on spaces of matrices with constant rank, the ones on spaces of matrices with rank bounded below and the ones on spaces of matrices with rank bounded above and to generalize a previous result on real matrices with constant rank to matrices on a more general field, we study the maximal dimension of affine subspaces of matrices whose rank is between two numbers under mild assumptions on the field. We get also a result on antisymmetric matrices and on matrices in row echelon form.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.