Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T13:36:53.238Z Has data issue: false hasContentIssue false

A Pólya–Vinogradov inequality for short character sums

Published online by Cambridge University Press:  02 December 2020

Matteo Bordignon*
Affiliation:
School of Science, University of New South Wales Canberra, Canberra, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, we obtain a variation of the Pólya–Vinogradov inequality with the sum restricted to a certain height. Assume $\chi $ to be a primitive character modulo q, $ \epsilon>0$ and $N\le q^{1-\gamma }$, with $0\le \gamma \le 1/3$. We prove that

$$ \begin{align*} |\sum_{n=1}^N \chi(n) |\le c (\tfrac{1}{3} -\gamma+\epsilon )\sqrt{q}\log q \end{align*} $$
with $c=2/\pi ^2$ if $\chi $ is even and $c=1/\pi $ if $\chi $ is odd. The result is based on the work of Hildebrand and Kerr.

Information

Type
Article
Copyright
© Canadian Mathematical Society 2020