2000 character limit reached
The Waring rank of the sum of pairwise coprime monomials (1112.3474v3)
Published 15 Dec 2011 in math.AC
Abstract: In this paper we compute the Waring rank of any polynomial of the form F=M_1+...+M_r, where the M_i are pairwise coprime monomials, i.e., GCD(M_i,M_j)=1 for i not j. In particular, we determine the Waring rank of any monomial. As an application we show that certain monomials in three variables give examples of forms of rank higher than the generic form. As a further application we produce a sum of power decomposition for any form which is the sum of pairwise coprime monomials.