Skip to main content
Log in

Pólya–Vinogradov and the least quadratic nonresidue

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

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 another approach to nonresidues. In this note we formulate a new line of attack on the least nonresidue via long character sums, an active area of research. Among other results, we demonstrate that improving the constant in the Pólya–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 \((\log k)^{1.4}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. It should be pointed out that Burgess’ character sum bound has been slightly improved by Hildebrand in [10]. However, his improvements do not yield an improvement of (1).

  2. Although not explicitly stated, this is easily derived from the proof of Theorem 6 in [9].

References

  1. Ankeny, N C.: The least quadratic non residue. Ann. Math. 55(2), 65–72 (1952)

  2. Balog, A., Granville, A., Soundararajan, K.: Multiplicative functions in arithmetic progressions, Ann. Math. Qué. 37(1), 3–30 (2013)

  3. Bober, J.: Averages of character sums, Preprint available at arXiv:1409.1840

  4. Goldmakher, L.: Character sums to smooth moduli are small, Canad. J. Math. 62(5), 1099–1115 (2010)

  5. Goldmakher, L.: Multiplicative mimicry and improvements to the Pólya–Vinogradov inequality. Algebra Num.b Theory 6(1), 123–163 (2012)

  6. Goldmakher, Leo, Lamzouri, Youness: Lower bounds on odd order character sums. Int. Math. Res. Not. IMRN 21, 5006–5013 (2012)

    MathSciNet  MATH  Google Scholar 

  7. Goldmakher, L., Lamzouri, Y.: Large even order character sums. Proc. Am. Math. Soc. 142(8), 2609–2614 (2014)

  8. Granville, A.: Smooth numbers: computational number theory and beyond. Math. Sci. Res. Inst. Publ., 44, pp 267–323, Cambridge Univ. Press, Cambridge (2008)

  9. Granville, A., Soundararajan, K.: Large character sums: pretentious characters and the Pólya–Vinogradov theorem. J. Am. Math. Soc. 20(2), 357–384 (2007)

  10. Hildebrand, A.: A note on Burgess’ character sum esimate. C. R. Math. Rep. Acad. Sci. Canada. VIII(1), 35–37 (1986)

  11. Hildebrand, A.: Large values of character sums. J. Numb. Theory 29(3), 271–296 (1988)

  12. Stephens, P.J.: Optimizing the size of \(L(1,\,\chi )\). Proc. Lond. Math. Soc. 24(3), 1–14 (1972)

Download references

Acknowledgments

We are grateful to John Friedlander and Soundararajan for encouragement and some helpful suggestions. We would also like to thank Enrique Treviño for correcting a misunderstanding about Hildebrand’s result, and the anonymous referee for meticulously reading the paper and making useful suggestions. The second author was partially supported by an NSERC Discovery Grant.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leo Goldmakher.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bober, J.W., Goldmakher, L. Pólya–Vinogradov and the least quadratic nonresidue. Math. Ann. 366, 853–863 (2016). https://doi.org/10.1007/s00208-015-1353-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00208-015-1353-2

Keywords

Navigation