2000 character limit reached
The Solution to Waring's Problem for Monomials
Published 4 Oct 2011 in math.AC and math.AG | (1110.0745v1)
Abstract: In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1{a_1},...,y_n{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve the Waring Problem for all monomials, i.e. we compute the minimal number of linear forms needed to write a monomial as a sum of powers of these linear forms. Moreover, we give an explicit description of a sum of powers decomposition for monomials. We also produce new bounds for the Waring rank of polynomials which are a sum of pairwise coprime monomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.