Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized identifiability of sums of squares

Published 7 Feb 2024 in math.AG and math.AC | (2402.05189v2)

Abstract: Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}r f_i2$ where $\mathrm{deg} f_i=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 $\mathrm{O}(r)$-orbits, the problem becomes counting how many different $\mathrm{O}(r)$-orbits of decomposition exist. We say that $f$ is $\mathrm{O}(r)$-identifiable if there is a unique $\mathrm{O}(r)$-orbit. We give sufficient conditions for generic and specific $\mathrm{O}(r)$-identifiability. Moreover, we show the generic $\mathrm{O}(r)$-identifiability of ternary forms.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.