Papers
Topics
Authors
Recent
Search
2000 character limit reached

Explicit Improvements to the Burgess Bound Via Pólya-Vinogradov

Published 16 Jul 2020 in math.NT | (2007.08119v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.