On the number of Waring decompositions for a generic polynomial vector (Q1678283): Difference between revisions

Waring decompositions compute the complexity of a polynomial, with respect to its representation as a symmetric tensor. When a minimal Waring decomposition is unique (up to scalar multiplication and permutation of the summands), then the polynomial is \textit{identifiable}. Identifiability plays a relevant role in the applications, because it allows to use freely the decomposition to simplify the manipulation of a polynomial. Several results are known for the identifiability of a single polynomial. The authors consider the case of a vector of polynomials, and look for the number of simultaneous Waring decompositions of the elements of the vector. When all the polynomials in the vector have the same degree, the problem can be translated in terms of \textit{Grassmann identifiability} of a set of tensors, and it has been studied in [\textit{E. Ballico} et al., Linear Algebra Appl. 438, No. 1, 121--135 (2013; Zbl 1255.14044)]. The authors consider the case of vectors of polynomials of arbitrary degrees. They prove that the Waring decompositions of such vectors are equivalent to the decompositions of points with respect to an immersion of a suitable projective bundle. With this reduction, and using the associated apolar ideal, the authors are able to prove several results on the identifiability of polynomial vectors. For instance, they show that a general rank \(7\) vector of three polynomials in three variables, with degrees \((3,3,4)\), is identifiable.