Improving the Burgess bound via Pólya-Vinogradov

From MaRDI portal
Publication:4644430

DOI10.1090/PROC/14171zbMATH Open1414.11100arXiv1706.03002OpenAlexW2963960305MaRDI QIDQ4644430FDOQ4644430


Authors: Elijah Fromm, Leo Goldmakher Edit this on Wikidata


Publication date: 7 January 2019

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1706.03002




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Improving the Burgess bound via Pólya-Vinogradov

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644430)