Sets computing the symmetric tensor rank

From MaRDI portal



Abstract: Let n_d denote the degree d Veronese embedding of a projective space P^r. For any symmetric tensor P, the 'symmetric tensor rank' sr(P) is the minimal cardinality of a subset A of P^r, such that n_d(A) spans P. Let S(P) be the space of all subsets A of P^r, such that n_d(A) computes sr(P). Here we classify all P in P^n such that sr(P) < 3d/2 and sr(P) is computed by at least two subsets. For such tensors P, we prove that S(P) has no isolated points.


Let \(\nu _d: \mathbb {P}^r \to \mathbb {P}^N\), \(N:= \binom{r+d}{r}-1\), denote the degree \(d\) Veronese embedding of \(\mathbb {P}^r\). For any \(P\in \mathbb {P}^N\), the symmetric tensor rank \(\mathrm{sr}(P)\) is the minimal cardinality of a set \(S\subset \nu _d(\mathbb {P}^r)\) spanning \(P\). Let \(\mathcal {S}(P)\) be the set of all \(A\subset \mathbb {P}^r\) such that \(\nu _d(A)\) computes \(\mathrm{sr}(P)\). In this paper the authors classify all \(P\in \mathbb {P}^n\) such that \(\mathrm{sr}(P) < 3d/2\) and \(\mathrm{sr}(P)\) is computed by at least two subsets of \(\nu _d(\mathbb {P}^r)\). For such tensors \(P\in \mathbb {P}^N\), they prove that \(\mathcal {S}(P)\) has no isolated points. Moreover they can prove that under the same hypothesis if \(\mathrm{sr}(P)\) is computed by at least two different sets, then it is computed by an infinite family without isolated points. This is an important result in terms of identifiability of (symmetric) tensors. Nowadays this is among the most studied problems expecially in the applications.











This page was built for publication: Sets computing the symmetric tensor rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949838)