Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Monomials as sum of k-th powers of forms (1305.4553v1)

Published 20 May 2013 in math.AC and math.AG

Abstract: Motivated by recent results on the Waring problem for polynomial rings and representation of monomial as sum of powers of linear forms, we consider the problem of presenting monomials of degree kd as sums of k-th powers of forms of degree d. We produce a general bound on the number of summands for any number of variables which we refine in the two variables case. We completely solve the k=3 case for monomials in two and three variables.

Summary

We haven't generated a summary for this paper yet.