2000 character limit reached
On the constant in the Polya-Vinogradov inequality
Published 25 Jul 2018 in math.NT | (1807.09573v1)
Abstract: In this paper we obtain a new constant in the P\'{o}lya-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 $\ell_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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.