2000 character limit reached
On the number of Waring decompositions for a generic polynomial vector (1601.01869v1)
Published 8 Jan 2016 in math.AG
Abstract: We prove that a general polynomial vector $(f_1, f_2, f_3)$ in three homogeneous variables of degrees $(3,3,4)$ has a unique Waring decomposition of rank 7. This is the first new case we are aware, and likely the last one, after five examples known since 19th century and the binary case. We prove that there are no identifiable cases among pairs $(f_1, f_2)$ in three homogeneous variables of degree $(a, a+1)$, unless $a=2$, and we give a lower bound on the number of decompositions. The new example was discovered with Numerical Algebraic Geometry, while its proof needs Nonabelian Apolarity.