Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 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

Waring's problem for polynomials in two variables (1104.0472v3)

Published 4 Apr 2011 in math.NT and math.AC

Abstract: We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)k+...+ Q_s(x_1,...,x_n)k$, provided that elements of the base field are themselves sums of $k$th powers. We also give bounds for the number of terms $s$ and the degree of the $Q_ik$. We then improve these bounds in the case of two variables polynomials of large degree to get a decomposition $P(x,y) = Q_1(x,y)k+...+ Q_s(x,y)k$ with $\deg Q_ik \le \deg P + k3$ and $s$ that depends on $k$ and $\ln (\deg P)$.

Summary

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