Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan–Hochster in their proof of Stillman’s conjecture and generalized here to other tensors, is universal among these ranks in the following sense: any non-trivial Zariski-closed condition on tensors that is functorial in the underlying vector space implies bounded strength. This generalizes a theorem by Derksen–Eggermont–Snowden on cubic polynomials, as well as a theorem by Kazhdan–Ziegler which says that a polynomial all of whose directional derivatives have bounded strength must itself have bounded strength
Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entr...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
The strength of a homogeneous polynomial (or form) is the smallest length of an additive decompositi...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entr...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently i...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a...
The strength of a homogeneous polynomial (or form) is the smallest length of an additive decompositi...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entr...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...
Matrices of rank at most k are defined by the vanishing of polynomials of degree k+1 in their entrie...