Explicit Burgess Bound for Composite Moduli
Niraek Jain-Sharma, Tanmay Khale, Mengzhen Liu
TL;DR
This paper establishes an explicit version of Burgess' bound for character sums specifically for composite moduli, providing concrete bounds useful for number theory applications.
Contribution
It introduces an explicit formulation of Burgess' bound tailored for composite moduli, enhancing previous implicit bounds.
Findings
Derived explicit bounds for character sums with composite moduli.
Improved estimates can be applied in analytic number theory.
Provides a foundation for further explicit bounds in related problems.
Abstract
We prove an explicit version of Burgess' bound on character sums for composite moduli.
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 · Finite Group Theory Research · Limits and Structures in Graph Theory