P\'olya-Vinogradov and the least quadratic nonresidue
Abstract
It is well-known that cancellation in short character sums (e.g. Burgess' estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess' work, so it is desirable to find a new approach to nonresidues. The goal of this note is to demonstrate a new line of attack via long character sums, a currently active area of research. Among other results, we demonstrate that improving the constant in the P\'olya-Vinogradov inequality would lead to significant progress on nonresidues. Moreover, conditionally on a conjecture on long character sums, we show that the least nonresidue for any odd primitive character (mod k) is bounded by ( k)1.4.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.