On the constant in the Polya-Vinogradov inequality

Abstract

In this paper we obtain a new constant in the P\'olya-Vinogradov inequality. Our argument follows previously established techniques which use the Fourier expansion of an interval to reduce to Gauss sums. Our improvement comes from approximating an interval by a function with slower decay on the edges and this allows for a better estimate of the 1 norm of the Fourier transform. This approximation induces an error for our original sums which we deal with by combining some ideas of Hildebrand with Garaev and Karatsuba concerning long character sums.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…