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
Created a new Item |
Created claim: Wikidata QID (P12): Q58920025, #quickstatements; #temporary_batch_1704771653347 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58920025 / rank | |||
Normal rank | |||
Revision as of 04:46, 9 January 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
