2000 character limit reached
Explicit Burgess inequalities for cubefree moduli
Published 21 Nov 2025 in math.NT | (2511.17778v1)
Abstract: Burgess proved that for a primitive Dirichlet character modulo with cubefree, for all integers More recently, explicit versions with prime moduli were computed by Booker, McGown, Treviño, and Francis, with applications to finding the least -th power residue, and bounding the size of Dirichlet -functions just to name a few. Jain-Sharma, Khale, and Liu proved an explicit estimate for We improve their explicit constant for and compute an explicit Burgess bound for cubefree for .
Paper Prompts
Sign up for free to create and run prompts on this paper.