Homotopy techniques for tensor decomposition and perfect identifiability

Let T be a general complex tensor of format (n_1,...,n_d). We show how homotopy techniques allow us to find all the decompositions of~$T$, starting from a given one. Computationally, this gives a guess regarding the total number of such decompositions. This guess matches exactly with all cases previously known, and predicts several unknown cases. Some surprising experiments yielded two new cases of generic identifiability: formats (3,4,5) and (2,2,2,3) which have a unique decomposition as the sum of 6 and 4 decomposable tensors, respectively. We conjecture that these two cases together with the classically known matrix pencils are the only cases where generic identifiability holds, i.e., the only identifiable cases. Building on the computational experiments, we use algebraic geometry to prove these two new cases are~indeed~generically~identifiable.