The maximum size of short character sums (Q2024945): Difference between revisions

For positive integer \(q\) and \(x>0\) let \[ \Delta(x,q)=\max_{\chi\neq\chi_0}\left|\sum_{n\leq x}\chi(n)\right|, \] where the maximum value is taken over all non-principle Dirichlet characters modulo \(q\). In the paper under review, the author obtains lower bounds for \(\Delta(x,q)\) under the condition \(q\) a sufficiently large prime and \(\log q<x\leq\exp(\sqrt{\log q})\), the condition \(\log x=(\log q)^\sigma\) for a fixed \(\sigma\in(0,1/2)\), the condition \(x=\log^A q\) with \(A>1\), and the condition \(\log q<x\leq\exp(\sqrt{\log q})\) together with the supplementary condition \(\log(1+\omega(q))(\log\log x-\log\log\log q)=o(\log\log q)\), where as usual \(\omega(q)\) counts the distinct prime factors of \(q\). All obtained bounds are in terms of the number of so called friable numbers.