Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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 Polynomial Rings and the Digit Sum of Exponents (1609.01213v1)

Published 5 Sep 2016 in math.NT

Abstract: Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these methods we establish bounds on the necessary number of $k$-th powers in terms of the sum of the digits of $k$ in its base-$p$ expansion. As one particular application we prove that for any fixed prime $p>2$ and any $\epsilon>0$ the number of $(pr-1)$-th powers required is $\mathcal{O}\left(r{(2+\epsilon)\ln(p)}\right)$ as a function of $r$.

Summary

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