arXiv · 2607.00592
Character sums over smooth numbers
Abstract
Let $\Psi (x,y)$ denote the count of $y$-smooth numbers below $x$ and $P(n)$ denote the largest prime factor of $n$. We show that \[ \frac{1}{\varphi(q)} \sum_{\chi \bmod q} \Bigl| \sum_{\substack{n \leq x \\ P(n) \leq y}} \chi(n) \Bigr| = o \Bigl( \sqrt{\Psi(x,y)} \Bigr), \] whenever $(\log x)^6 \leq y \leq x^{\frac{1}{32 \log \log x}}$ and $q \geq x^{1 + \varepsilon}$ for some small quantifiable $\varepsilon > 0$. The saving is substantial when $\varepsilon$ is fixed away from zero, and we prove similar results for continuous characters and completely multiplicative twists of these sums.
Explore related subjects
Keep this discovery
Seth Hardy, Max Wenqiang Xu. 2026-07-01. Character sums over smooth numbers. https://arxiv.org/abs/2607.00592
Cite the original work for its findings. Save a collection to share your selection of sources.