相关论文: On generic identifiability of symmetric tensors of…

We investigate the uniqueness of decomposition of general tensors $T\in {\mathbb C}^{n_1+1}\otimes\cdots\otimes{\mathbb C}^{n_r+1}$ as a sum of tensors of rank $1$. This is done extending the theory developed in a previous paper by the…

We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…

In this paper we study the identifiability of specific forms (symmetric tensors), with the target of extending recent methods for the case of $3$ variables to more general cases. In particular, we focus on forms of degree $4$ in $5$…

We propose a new sufficient condition for verifying whether generic rank-r complex tensors of arbitrary order admit a unique decomposition as a linear combination of rank-1 tensors. A practical algorithm is proposed for verifying this…

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a sum of symmetric outer product of vectors. A rank-1 order-k…

The identifiability of parameters in a probabilistic model is a crucial notion in statistical inference. We prove that a general tensor of rank 8 in C^3\otimes C^6\otimes C^6 has at least 6 decompositions as sum of simple tensors, so it is…

Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$.…

We present several conditions for generic uniqueness of tensor decompositions of multilinear rank (1,L_{1}, L_{1}),..., (1, L_{R}, L_{R}) terms. In geometric language, we prove that the joins of relevant subspace varieties are not…

We study typical ranks with respect to a real variety $X$. Examples of such are tensor rank ($X$ is the Segre variety) and symmetric tensor rank ($X$ is the Veronese variety). We show that any rank between the minimal typical rank and the…

We find conditions that guarantee that a decomposition of a generic third-order tensor in a minimal number of rank-$1$ tensors (canonical polyadic decomposition (CPD)) is unique up to permutation of rank-$1$ tensors. Then we consider the…

A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which…

Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…

We use methods of algebraic geometry to find new, effective methods for detecting the identifiability of symmetric tensors. In particular, for ternary symmetric tensors T of degree 7, we use the analysis of the Hilbert function of a finite…

We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…

We investigate whether eigenvectors, also known as critical rank-one approximations, of a symmetric tensor can be used to increase or decrease its Waring rank. First, we study the variety of degree-d rank-r forms which admit an eigenvector…

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…

Let $\sigma_b(X_{m,d}(\mathbb {C}))(\mathbb {R})$, $b(m+1) < \binom{m+d}{m}$, denote the set of all degree $d$ real homogeneous polynomials in $m+1$ variables (i.e. real symmetric tensors of format $(m+1)\times ... \times (m+1)$, $d$ times)…

The new identifiable case appeared in \cite{AGMO}, together with the analysis on simultaneous identifiability of pairs of ternary forms recently developed in \cite{BG}, suggested the following conjecture towards a complete classification of…

For real and complex homogeneous cubic polyomials in $n+1$ variables, we prove that the Chow variety of products of linear forms is generically complex identifiable for all ranks up to the generic rank minus two. By integrating fundamental…

We prove that the general tensor of size 2^n and rank k has a unique decomposition as the sum of decomposable tensors if k<= 0.9997 (2^n)/(n+1) (the constant 1 being the optimal value). Similarly, the general tensor of size 3^n and rank k…