Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 104 tok/s Pro
Kimi K2 170 tok/s Pro
GPT OSS 120B 468 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Large spaces of bounded rank matrices revisited (1507.05375v2)

Published 20 Jul 2015 in math.RA

Abstract: Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders states that the dimension of a rank-$\overline{r}$ linear subspace must be less than or equal to $nr$, and it characterizes the spaces with the critical dimension $nr$. Linear subspaces with dimension close to the critical one were later studied by Atkinson, Lloyd and Beasley over fields with large cardinality; their results were recently extended to all fields. Using a new method, we obtain a classification of rank-$\overline{r}$ affine subspaces with large dimension, over all fields. This classification is then used to double the range of (large) dimensions for which the structure of rank $\overline{r}$-linear subspaces is known for all fields.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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