English

An explicit P\'{o}lya-Vinogradov inequality via Partial Gaussian sums

Number Theory 2019-09-04 v1

Abstract

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for squarefree modulus. Given a primitive character χ\chi to squarefree modulus qq, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le N} \chi(n) \right|\le c \sqrt{q} \log q, \end{align*} where c=1/(2π2)+o(1)c=1/(2\pi^2)+o(1) for even characters and c=1/(4π)+o(1)c=1/(4\pi)+o(1) for odd characters, with an explicit o(1)o(1) term. This improves a result of Frolenkov and Soundararajan for large qq. We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of logq\log{q} as in previous approaches and is an important factor for fully explicit bounds.

Keywords

Cite

@article{arxiv.1909.01052,
  title  = {An explicit P\'{o}lya-Vinogradov inequality via Partial Gaussian sums},
  author = {Matteo Bordignon and Bryce Kerr},
  journal= {arXiv preprint arXiv:1909.01052},
  year   = {2019}
}