arXiv · 1706.03002
Improving the Burgess bound via Polya-Vinogradov
Abstract
We show that even mild improvements of the Polya-Vinogradov inequality would imply significant improvements of Burgess' bound on character sums. Our main ingredients are a lower bound on certain types of character sums (coming from works of the second author joint with J. Bober and Y. Lamzouri) and a quantitative relationship between the mean and the logarithmic mean of a completely multiplicative function.
Explore related subjects
Keep this discovery
Elijah Fromm, Leo Goldmakher. 2017-06-09. Improving the Burgess bound via Polya-Vinogradov. https://arxiv.org/abs/1706.03002
Cite the original work for its findings. Save a collection to share your selection of sources.