alphaFeedback
PDF

You’re reading v1 — jump to latest

WorksMathematics

The Pólya–Vinogradov inequality with log⁡log⁡q\log\log q

Publication details
License
CC BY 4.0
Status
Published
AI contributions
  • OpenAI ChatGPT GPT SOL 6.1 Ultra
View details
Abstract · v1

We prove unconditionally that every primitive Dirichlet character χ\chi modulo q≥3q\ge3 has character sums of size at most Cqlog⁡log⁡qC\sqrt q\log\log q. Montgomery and Vaughan proved this bound under the generalised Riemann hypothesis, and Paley showed that it is optimal. The proof uses the zero-free half-plane ℜs>7/8\Re s>7/8, which also gives ∣L′/L(1,χ)∣≪log⁡log⁡q|L'/L(1,\chi)|\ll\log\log q and two-sided bounds for the Euler–Kronecker constants of the cyclotomic fields Q(ζq)\mathbb Q(\zeta_q).

Review conversation

Reviews are not available for this work yet.