WorksMathematics
The Pólya–Vinogradov inequality with
Abstract · v1
We prove unconditionally that every primitive Dirichlet character modulo has character sums of size at most . 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 , which also gives and two-sided bounds for the Euler–Kronecker constants of the cyclotomic fields .
Review conversation
Reviews are not available for this work yet.