Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bounded-rank tensors are defined in bounded degree (1103.5336v2)

Published 28 Mar 2011 in math.AG

Abstract: Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this statement for tensors of arbitrary dimension, where matrices correspond to two-dimensional tensors. More specifically, we prove that for each k there exists an upper bound d = d(k) such that tensors of border rank at most k are defined by the vanishing of polynomials of degree at most d, regardless of the dimension of the tensor and regardless of its sizes in each dimension. Our proof involves passing to an infinite-dimensional limit of tensor powers of a vector space, whose elements we dub infinite-dimensional tensors, and exploiting the symmetries of this limit in crucial way.

Summary

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