Exponential sums over primes are unbounded
We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} Λ(m) \mathrm{e}(αm)\right|^2 \gg y\log y$$ whenever $y \ll x^{1/3-\varepsilon}.$ This answers a question of Ramaré by proving the lower bound $$\sup_{n\le x} \left|\sum_{m\le n} Λ(m) \mathrm{e}(αm)\right| \gg x^{1/6 - \varepsilon}.$$
Publication Details
- Journal
- ArXiv.org
- Published
- 2025-08-25
- Primary Topic
- Geochemistry and Geologic Mapping
- Type
- article
- Field-Weighted Citation Impact
- 0.00