An upper bound for the tensor rank

DOI10.1155/2013/241835zbMath1268.15026OpenAlexW2085688188WikidataQ58994342 ScholiaQ58994342MaRDI QIDQ1952650

Edoardo Ballico

Publication date: 3 June 2013

Published in: ISRN Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/241835

zbMATH Keywords

upper boundtensor rank

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (2)

Linear subspaces of symmetric tensors whose non-zero elements have at least a prescribed rank ⋮ Symmetric tensor rank and scheme rank: an upper bound in terms of secant varieties

Cites Work

• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Refined methods for the identifiability of tensors
• Multiarray signal processing: tensor decomposition meets compressed sensing
• Rank and optimal computation of generic tensors
• An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Representations of multivariate polynomials by sums of univariate polynomials in linear forms

This page was built for publication: An upper bound for the tensor rank