2000 character limit reached
An Investigation Into Several Explicit Versions of Burgess' Bound
Published 30 Oct 2019 in math.NT | (1910.13669v2)
Abstract: Let $\chi$ be a Dirichlet character modulo $p$, a prime. In applications, one often needs estimates for short sums involving $\chi$. One such estimate is the family of bounds known as \emph{Burgess' bound}. In this paper, we explore several minor adjustments one can make to the work of Enrique Trevi~no on explicit versions of Burgess' bound. For an application, we investigate the problem of the existence of a $k$th power non-residue modulo $p$ which is less than $p\alpha$ for several fixed $\alpha$. We also provide a quick improvement to the conductor bounds for norm-Euclidean cyclic fields.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.