Bounds on the tensor rank (Q1756466)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bounds on the tensor rank
scientific article

    Statements

    Bounds on the tensor rank (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 January 2019
    0 references
    Given a tensor $T\in \mathbb C^{n_1+1}\times \dots\times \mathbb C^{n_k+1}$, we can view (modulo scalar multiplication) $T$ as a point in $Y = \nu(\mathbb P^{n_1}\times\dots \times \mathbb P^{n_k})\subset \mathbb P^{M}$, with $M=-1+\Pi_{i=1}^k(n_i+1)$, where $v$ is the Segre embedding. The tensor rank $r$ of $T$ can be expressed as the minimum number $r$ for which there exixt a set $A$ of $r$ simple points in $Y$ such that $T\in < A >$ (in fact $Y$ parameterizes decomposable tensors). In this paper the rank of $T$ is studied via the behavior of projections of $0$-dimensional schemes $S\subset Y$ under projections on ``flattenings'' of $Y$, i.e. chosing a partition $\{a_1,\dots,a_h\}\cup \{b_1,\dots,b_{k-h}\}=\{1,\dots,k\}$ and projecting $S$ into the Segre embeddings of $ \mathbb P^{a_1}\times\dots\times \mathbb P^{a_h}$ and $\mathbb P^{b_1}\times \dots\times \mathbb P^{b_{h-k}}$ (see Thm. 3.1). Using this lind of analisys, a critherion is given for determining if some $S\subset Y$ with $T\in < S >$ gives a minimal decomposition of $T$ (i.e. if $S$ computes $r(T)$ or not); moreover, also a critherion to determine if $S$ is the unique minimal decomposition (identifiability ) is given.
    0 references
    tensor rank
    0 references
    identifiability
    0 references
    Comon conjecture
    0 references

    Identifiers