z-logo
open-access-imgOpen Access
An Upper Bound for the Symmetric Tensor Rank of a Low Degree Polynomial in a Large Number of Variables
Author(s) -
Edoardo Ballico
Publication year - 2013
Publication title -
geometry
Language(s) - English
Resource type - Journals
eISSN - 2314-4238
pISSN - 2314-422X
DOI - 10.1155/2013/715907
Subject(s) - algorithm , artificial intelligence , computer science
Fix integers m≥5 and d≥3. Let f be a degree d homogeneous polynomial in m+1 variables. Here, we prove that f is the sum of at most d·⌈(m+dm)/(m+1)⌉d-powers of linear forms (of course, this inequality is nontrivial only if m≫d.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom