An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables (Q2260774): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2013/715907 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040997540 / rank | |||
Normal rank | |||
Revision as of 20:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables |
scientific article |
Statements
An upper bound for the symmetric tensor rank of a low degree polynomial in a large number of variables (English)
0 references
12 March 2015
0 references
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\)).
0 references
