2000 character limit reached
On the asymptotic formula in Waring's problem with shifts
Published 29 Nov 2016 in math.NT | (1611.09889v1)
Abstract: We show that for integers $k\geq 4$ and $s\geq k2+(3k-1)/4$, we have an asymptotic formula for the number of solutions, in positive integers $x_i$, to the inequality $\left|(x_1-\theta_1)k+\dotsc+(x_s-\theta_s)k-\tau\right|<\eta$, where $\theta_i\in(0,1)$ with $\theta_1$ irrational, $\eta\in(0,1]$, and $\tau>0$ is sufficiently large. We use Freeman's variant of the Davenport--Heilbronn method, along with a new estimate on the Hardy--Littlewood minor arcs, to obtain this improvement on the original result of Chow.
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.