加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本