@article{9364,
  abstract     = {Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H<p ∣ 1/√p ∑ 0≤n<H t (n) ∣ of the absolute value of the incomplete sums(1/√p)∑0≤n<H t (n). In this very general context one of the most important results is the Pólya–Vinogradov bound M(t)≤IIˆtII∞ log 3p, where ˆt : Fp → C is the normalized Fourier transform of t. In this paper we provide a lower bound for certain incomplete Kloosterman sums, namely we prove that for any ε > 0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).},
  author       = {Bonolis, Dante},
  issn         = {1469-8064},
  journal      = {Mathematical Proceedings of the Cambridge Philosophical Society},
  number       = {3},
  pages        = {563 -- 590},
  publisher    = {Cambridge University Press},
  title        = {{On the size of the maximum of incomplete Kloosterman sums}},
  doi          = {10.1017/S030500412100030X},
  volume       = {172},
  year         = {2022},
}