2000 character limit reached
Sub-Weyl strength bounds for twisted $GL(2)$ short character sums
Published 20 Sep 2022 in math.NT | (2209.09479v1)
Abstract: Let $$S(N) = \sum_{n \sim N}{\text{smooth}} \, \lambda_{f}(n) \, \chi(n),$$ where $\lambda_{f}(n)$'s are Fourier coefficients of Hecke-eigen form, and $\chi$ is a primitive character of conductor $p{r}$. In this article we prove a sub-Weyl strength bounds for $S(N)$. Indeed, we obtain $$S(N) \ll \, N{\frac{5}{9}} \ p{\frac{13r}{45}},$$ provided that $ p{13r/20} \leq N \leq p{4r/5}$. Note that the above bound for $S(N)$ is non-trivial if $N\geq \left(p{r}\right){\frac{2}{3}-\frac{1}{60}}$.
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.