English

A P\'{o}lya--Vinogradov inequality for short character sums

Number Theory 2021-02-22 v2

Abstract

In this paper we obtain a variation of the P\'{o}lya--Vinogradov inequality with the sum restricted to a certain height. Assume χ\chi to be a primitive character modulo qq, ϵ>0\epsilon > 0 and Nq1γN\le q^{1-\gamma}, with 0γ1/30\le \gamma \le 1/3. We prove that \begin{equation*} \left|\sum_{n=1}^N \chi(n) \right|\le c(\frac{1}{3}-\gamma+\epsilon)\sqrt{q}\log q \end{equation*} with c=2/π2+o(1)c=2/\pi^2+o(1) if χ\chi is even and c=1/π+o(1)c=1/\pi+o(1) if χ\chi is odd.

Keywords

Cite

@article{arxiv.2002.02640,
  title  = {A P\'{o}lya--Vinogradov inequality for short character sums},
  author = {Matteo Bordignon},
  journal= {arXiv preprint arXiv:2002.02640},
  year   = {2021}
}

Comments

6 pages