Generalized identifiability of sums of squares
arXiv:2402.05189 · doi:10.1016/j.jalgebra.2024.07.052
Abstract
Let be a homogeneous polynomial of even degree . We study the decompositions where . The minimal number of summands is called the -rank of , so that the polynomials having -rank equal to are exactly the squares. Such decompositions are never unique and they are divided into -orbits, the problem becomes counting how many different -orbits of decomposition exist. We say that is -identifiable if there is a unique -orbit. We give sufficient conditions for generic and specific -identifiability. Moreover, we show the generic -identifiability of ternary forms.
arXiv comment14 pages, to appear in Journal of Algebra
References in corpus (7)
- An algorithm for generic and low-rank specific identifiability of complex tensors
- On generic identifiability of symmetric tensors of subgeneric rank
- On the Waring problem for polynomial rings
- On generic and maximal k-ranks of binary forms
- On a notion of speciality of linear systems in P^n
- Identifiability for mixtures of centered Gaussians and sums of powers of quadratics
- On the degree of varieties of sum of squares