Explicit Improvements to the Burgess Bound Via P\'olya-Vinogradov
Matteo Bordignon, Forrest Francis

TL;DR
This paper improves the Burgess bound for short character sums by explicitly refining constants in the Pólya-Vinogradov inequality, supported by explicit estimates of multiplicative functions and the Dickman function.
Contribution
It provides explicit versions of key estimates that enable better constants in the Burgess bound through the Pólya-Vinogradov inequality.
Findings
Explicit bounds for mean values of real multiplicative functions
Refined estimates of the Dickman function
Improved constants in the Burgess bound
Abstract
We make explicit a theorem of Fromm and Goldmakher [arXiv:1706.03002], which states that one can improve Burgess' bound for short character sums simply by improving the leading constant in the P\'{o}lya-Vinogradov inequality. Towards achieving this, we establish explicit versions of several estimates related to the mean values of real multiplicative functions and the Dickman function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Finite Group Theory Research
