Affine subspaces of matrices with rank in a range
Elena Rubei

TL;DR
This paper investigates the maximal dimension of affine subspaces of matrices with ranks within a specified range, unifying previous results on constant and bounded rank matrices and extending them to more general fields.
Contribution
It provides a comprehensive result on the maximal dimension of affine matrix subspaces with rank constraints, generalizing earlier findings and including new cases like antisymmetric and row echelon matrices.
Findings
Unified bounds for affine subspaces with rank in a range
Extension of constant rank results to more general fields
Results on antisymmetric and row echelon matrices
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 give rise to vector bundle maps whose images are vector bundles of rank . Moreover there is a link with the so called ``rank metric codes'', since a constant rank subspace of can be viewed as a constant weight rank metric code; it can be interesting to study also the maximal dimension of the subspaces of whose elements have rank in a range , since such subspaces obviously give rank metric codes with weights in . In this paper, with the main purpose to get an organic result including the ones on…
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
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Optimization Algorithms Research
