A note on character sums (Q5902349)

Let \(\chi\) be a primitive charecter modulo \(q\). According to the famous Pólya-Vinogradov inequality, for any positive integer \(n\), \(\big| \sum_{k=1}\chi(k)\big| \ll \sqrt{q}\log q\). For lower bounds of \(\max_n\big| \sum^n_{k=1}\chi(k)\big| \), see \textit{A. Rényi} [Dokl. Akad. Nauk SSSR 56, 675--678 (1947; Zbl 0030.34501)], \textit{A. Sárközi} [Acta Math. Acad. Sci. Hungar. 30, 155--162 (1977; Zbl 0372.10032)], \textit{A. V. Sokolovskij} [Acta Arith. 41, 27--31 (1982; Zbl 0417.10032)]. In the paper under review the author proves a variant of the Pólya-Vinogradov inequality concerning \(\big| \sum^m_{n=1}\, \sum^n_{k=1} \chi(k)\big| \) and some discrepancy-type inequalities for certain exponential sums. Combining the results the author obtains that \[ \max_{1\leq m\leq q}\big| \sum^m_{n=1}\, \sum^n_{k=1}\chi(k)\big| \geq (8\pi^2)^{-1}q^{3/2}. \]