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.
Recommendations
Cites work
Cited in
(11)- On a generalisation of a Lehmer problem
- Modular hyperbolas
- The congruence \(x_1 x_2 \equiv x_3 x_4\) and mean values of character sums
- On congruences with products of variables from short intervals and applications
- Mean value theorems for binary Egyptian fractions. II
- On a Set of Congruences Related to Character Sums II
- Mean values of character sums
- The congruence \(ax_1x_2\cdots x_k + bx_{k+1}x_{k+2}\cdots x_{2k} \equiv c \pmod p\)
- The distribution of the maximum of character sums
- Bounds for moments of quadratic character sums and theta functions
- On \(s\)-dimensional incomplete Kloosterman sums
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)