2000 character limit reached
Perturbations of Weyl sums
Published 1 Mar 2015 in math.NT | (1503.00294v1)
Abstract: Write $f_k({\boldsymbol \alpha};X)=\sum_{x\le X}e(\alpha_1x+\ldots +\alpha_kxk)$ $(k\ge 3)$. We show that there is a set ${\mathfrak B}\subseteq [0,1){k-2}$ of full measure with the property that whenever $(\alpha_2,\ldots ,\alpha_{k-1})\in {\mathfrak B}$ and $X$ is sufficiently large, then $$\sup_{(\alpha_1,\alpha_k)\in [0,1)2}|f_k({\boldsymbol \alpha};X)|\le X{1/2+4/(2k-1)}.$$ For $k\ge 5$, this improves on work of Flaminio and Forni, in which a Diophantine condition is imposed on $\alpha_k$, and the exponent of $X$ is $1-2/(3k(k-1))$.
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.