Papers
Topics
Authors
Recent
Search
2000 character limit reached

Border subrank via a generalised Hilbert-Mumford criterion

Published 16 Feb 2024 in math.AG and cs.CC | (2402.10674v2)

Abstract: We show that the border subrank of a sufficiently general tensor in $(\mathbb{C}n){\otimes d}$ is $\mathcal{O}(n{1/(d-1)})$ for $n \to \infty$. Since this matches the growth rate $\Theta(n{1/(d-1)})$ for the generic (non-border) subrank recently established by Derksen-Makam-Zuiddam, we find that the generic border subrank has the same growth rate. In our proof, we use a generalisation of the Hilbert-Mumford criterion that we believe will be of independent interest.

Citations (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.

Collections

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