pith. sign in

arxiv: 0911.5547 · v2 · pith:MXY4JCZTnew · submitted 2009-11-30 · 🧮 math.NT

Multiplicative mimicry and improvements of the Polya-Vinogradov inequality

classification 🧮 math.NT
keywords charactersumsmultiplicativeorderapplicationbelongbestbound
0
0 comments X
read the original abstract

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet character. As an application we improve current bounds on odd order character sums. Furthermore, conditionally on the Generalized Riemann Hypothesis we obtain a bound for odd order character sums which is best possible.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.