An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables (Q2260774): Difference between revisions

Summary: Fix integers \(m \geq 5\) and \(d \geq 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 \cdot [\binom{m+d}{m}/(m+1)]d\)-powers of linear forms (of course, this inequality is nontrivial only if \(m \gg d\)).