Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters (Q2157355)

In the paper under review, the author obtains an explicit form of the Pólya-Vinogradov inequality for primitive characters, by showing that given a primitive character \(\chi\) modulo \(q\), for any \(q\geq q_0\) with \(q_0\), \(\varepsilon>0\) and \(h_{1,2}(q_0,\varepsilon)\) given explicitly in numerical tables, one has \[ \left|\sum_{1\leq n\leq N}\chi(n)\right|\leq \frac{2}{\pi^2}\left(\frac{3}{8}+\varepsilon\right)\sqrt{q}\log q+h_{1}(q_0,\varepsilon)\sqrt{q} \] when \(\chi(-1)=+1\), and \[ \left|\sum_{1\leq n\leq N}\chi(n)\right|\leq \frac{1}{\pi}\left(\frac{3}{8}+\varepsilon\right)\sqrt{q}\log q+h_{2}(q_0,\varepsilon)\sqrt{q} \] when \(\chi(-1)=-1\). The proof follows an argument due to Hildebrand, based on obtaining the explicit version of a result by Montgomery-Vaughan on partial Gaussian sums and an explicit Burgess-like result on convoluted Dirichlet characters.