Identifiability beyond Kruskal's bound for symmetric tensors of degree 4 (Q1650838)

From MaRDI portal
Revision as of 09:37, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Identifiability beyond Kruskal's bound for symmetric tensors of degree 4
scientific article

    Statements

    Identifiability beyond Kruskal's bound for symmetric tensors of degree 4 (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2018
    0 references
    The authors consider quartic homogeneous polynomial in \(n+1\), i.e., elements of \(S^4\mathbb{C}^{n+1}\) which have a minimal additive decomposition as a sum of \((2n+1)\) \(4\)-powers of linear forms and find a criterion for the uniqueness of the decomposition in geometric terms (associating to each linear form a point of \(\mathbb {P}^n(\mathbb {C})\)). The degree 3 cases would have been the symmetric form of the celebrated Kruskal's uniqueness criterion for \(3\)-tensors. This was extended to any \(n\)-tensors and the symmetric version of it was recently proved [\textit{L. Chiantini} et al., Trans. Amer. Math. 369, No. 6, 4021--4042 (2017; Zbl 1360.14021)]. The paper under review goes to the next step, the first step not covered by the generalized (symmetric) Kruskal's criterion. The proof is geometric, use a study of the Hilbert function of a finite set in \(\mathbb {P}^n(\mathbb {C})\), the Castelnuovo lemma and an extension to the relative case of the Cayley-Bacharach condition.
    0 references
    Waring decomposition
    0 references
    Kruskal's criterion
    0 references
    Cayley-Bacharach property
    0 references
    Castelnuovo's lemma
    0 references
    identifiability of symmetric tensors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references