An algorithm for the non-identifiability of rank-3 tensors (Q6176308)

Decompositions of tensors as a sum of elementary products are fundamental in many applications of multilinear algebra. Tensors are identifiable when their minimal decomposition is unique (up to trivialities). While there are many results that guarantee the identifiability of generic tensors of given rank, there are not too many non-trivial cases in which the identifiability of a given, specific tensor can be completely determined, without knowing the decomposition. \textit{E. Ballico} et al. [Mediterr. J. Math. 18, No. 4, Paper No. 174, 26 p. (2021; Zbl 1475.14101)] proved a geometric characterization of non-identifiable tensors of rank 3. Following the characterization, in the paper under review the author constructs a concrete algorithm which checks if a given tensor of rank 3 is identifiable or not. The algorithm in principle works with tensors of any dimension. A specific Macaulay2 code for tensors of dimension 3 is contained in the paper. In the final appendix, Ballico, Bernardi, and the author fix an imprecision contained in their classification Theorem 7.1 of [loc. cit.].