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 to be a primitive character modulo , and , with . 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 if is even and if is odd.
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