Linear subspaces of symmetric tensors whose non-zero elements have at least a prescribed rank
From MaRDI portal
Publication:2254917
DOI10.1007/s40065-014-0099-0zbMath1305.14022OpenAlexW2107726032WikidataQ59395684 ScholiaQ59395684MaRDI QIDQ2254917
Publication date: 6 February 2015
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-014-0099-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of homogeneous polynomials with low rank
- Computing symmetric rank for symmetric tensors
- On the rank of a binary form
- On the ranks and border ranks of symmetric tensors
- Secant varieties to osculating varieties of Veronese embeddings of \(\mathbb P^n\)
- Theory of codes with maximum rank distance
- The blowing up Horace method: Application to interpolation in degree four
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- The solution to the Waring problem for monomials and the sum of coprime monomials
- An upper bound for the tensor rank
- Symmetric tensor rank and scheme rank: an upper bound in terms of secant varieties
- On the Alexander-Hirschowitz theorem
- A brief proof of a maximal rank theorem for generic double points in projective space
- Stratification of the fourth secant variety of Veronese varieties via the symmetric rank
- Determinantal equations for secant varieties and the Eisenbud-Koh-Stillman conjecture
- Packing and Covering Properties of Rank Metric Codes
- ON DIFFERENCES BETWEEN THE BORDER RANK AND THE SMOOTHABLE RANK OF A POLYNOMIAL
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
This page was built for publication: Linear subspaces of symmetric tensors whose non-zero elements have at least a prescribed rank
