2000 character limit reached
Shifted Character Sums with Multiplicative Coefficients, II
Published 20 Nov 2016 in math.NT | (1611.06577v1)
Abstract: Let $f(n)$ be a multiplicative function with $|f(n)|\leq 1, q$ be a prime number and $a$ be an integer with $(a, q)=1, \chi$ be a non-principal Dirichlet character modulo $q$. Let $\varepsilon$ be a sufficiently small positive constant, $A$ be a large constant, $q{\frac12+\varepsilon}\ll N\ll qA$. In this paper, we shall prove that $$ \sum_{n\leq N}f(n)\chi(n+a)\ll N\frac{\log\log q}{\log q} $$ and that $$ \sum_{n\leq N}f(n)\chi(n+a_1)\cdots\chi(n+a_t)\ll N\frac{\log\log q}{\log q}, $$ where $t\geq 2, a_1, \ldots, a_t$ are distinct integers modulo $q$.
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.