Generalized identifiability of sums of squares
Abstract
Let f be a homogeneous polynomial of even degree d. We study the decompositions f=Σi=1r fi2 where deg fi=d/2. The minimal number of summands r is called the 2-rank of f, so that the polynomials having 2-rank equal to 1 are exactly the squares. Such decompositions are never unique and they are divided into O(r)-orbits, the problem becomes counting how many different O(r)-orbits of decomposition exist. We say that f is O(r)-identifiable if there is a unique O(r)-orbit. We give sufficient conditions for generic and specific O(r)-identifiability. Moreover, we show the generic O(r)-identifiability of ternary forms.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.