An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables
From MaRDI portal
Publication:2260774
DOI10.1155/2013/715907zbMath1307.15035OpenAlexW2040997540WikidataQ58920025 ScholiaQ58920025MaRDI QIDQ2260774
Publication date: 12 March 2015
Published in: Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/715907
Vector and tensor algebra, theory of invariants (15A72) Projective techniques in algebraic geometry (14N05)
Related Items (3)
Symmetric tensor rank over an infinite field ⋮ An upper bound for the tensor rank ⋮ Symmetric tensor rank and scheme rank: an upper bound in terms of secant varieties
Cites Work
- Computing symmetric rank for symmetric tensors
- On the rank of a binary form
- On the ranks and border ranks of symmetric tensors
- The blowing up Horace method: Application to interpolation in degree four
- Ranks of tensors and a generalization of secant varieties
- On the Alexander-Hirschowitz theorem
- Joins and higher secant varieties.
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
This page was built for publication: An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables