High order moments of character sums

From MaRDI portal
Publication:4383080





The main result in this paper is the mean value estimate \[ (p-1)^{-1}\sum_{\chi \neq \chi _0}\left |\sum_{x=a+1}^{a+B}\chi (x)\right |^{2k} \ll p^{k-1+\varepsilon}+B^kp^{\varepsilon}, \] where \(p\) is a prime, \(\chi \) runs over non-principal characters \(\pmod{p}\), and the implied constant depends on \(k\) (a positive integer) and \(\varepsilon >0\). Note that the second term on the right is essentially of the expected order, and it dominates if \(B\gg p^{1-1/k}\). The proof goes back to counting solutions of a certain congruence.











This page was built for publication: High order moments of character sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383080)