Waring decompositions and identifiability via Bertini and Macaulay2 software (Q1994131)

A complex homogeneous polynomial \(p\) of degree \(d\) in \(n+1\) variables is Waring identifiable if it admits a unique decomposition (up to reordering and rescaling) as linear combination of dth powers of complex homogeneous polynomials of degree \(1\) in \(n+1\) variables. When Waring identifiability fails, there are two alternatives to try to recover it: by introducing in a similar way the simultaneous decomposition of more forms with the same number of summands or by means of real identifiability. We will also say that a general form or polynomial vector with real coefficients, not Waring identifiable, is real identifiable if it admits a unique decomposition with real linear forms and real scalars. In this paper, starting from previous papers [\textit{E. Angelini} et al., J. Pure Appl. Algebra 222, No. 4, 950--965 (2018; Zbl 1390.14158); Linear Multilinear Algebra 66, No. 6, 1257--1267 (2018; Zbl 1393.14052)], the author proves ``the existence of a non-empty Euclidean open subset whose elements are polynomial vectors with \(4\) components, in \(3\) variables, with degrees, respectively, \(2\), \(3\), \(3\), \(3\) and rank \(6\), which are not identifiable over \(\mathbb{C}\) but are identifiable over \(\mathbb{R}\)''. This result has been obtained by means of computer-aided procedures carried out properly coordinating the Bertini software with Matlab and applying a technique based on homotopy continuation and monodromy loops. In addition, the author proves identifiability over \(\mathbb{C}\) for polynomial vectors in many cases of sub-generic rank, by using a different computational approach performed with the software Macaulay2 and applying a method based on the Hessian criterion [\textit{L. Chiantini} et al., SIAM J. Matrix Anal. Appl. 35, No. 4, 1265--1287 (2014; Zbl 1322.14022)].