A family of explicit Waring decompositions of a polynomial
Kangjin Han, Hyunsuk Moon
TL;DR
The paper addresses explicit Waring decompositions for monomials and homogeneous forms, introducing a parametric combinatorial identity that writes $D_\\mathbf{a} X_0^{a_0}\\cdots X_n^{a_n}$ as a sum of $d$-th powers of linear forms with computable coefficients. This yields a completely explicit decomposition and an upper bound for the monomial Waring rank $\\mathrm{rank}_\\Bbbk(M) \le \tfrac12(\\prod_i (a_i+1) - \\prod_i (a_i-1))$, and extends to general homogeneous forms via (de)homogenization. The authors compare with existing apolarity-based and rational decompositions, showing asymptotically fewer summands through a refined count $K(n,D)$, and provide a Macaulay2 implementation with a concrete case $X_0^4X_1^3X_2^2$ yielding a one-parameter family of 27-summand decompositions. These results have practical impact for polynomial computation and symmetric tensor problems by delivering explicit, low-sum representations and a usable computational toolkit.
Abstract
In this paper we settle some polynomial identity which provides a family of explicit Waring decompositions of any monomial $X_0^{a_0}X_1^{a_1}\cdots X_n^{a_n}$ over a field $\Bbbk$. This gives an upper bound for the Waring rank of a given monomial and naturally leads to an explicit Waring decomposition of any homogeneous form and, eventually, of any polynomial via (de)homogenization. Note that such decomposition is very useful in many applications dealing with polynomial computations, symmetric tensor problems and so on. We discuss some computational aspect of our result as comparing with other known methods and also present a computer implementation for potential use in the end.
