Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 39 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 118 tok/s Pro
Kimi K2 181 tok/s Pro
GPT OSS 120B 429 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Generalized identifiability of sums of squares (2402.05189v2)

Published 7 Feb 2024 in math.AG and math.AC

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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