High order moments of character sums (Q4383080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1132342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High order moments of character sums |
scientific article; zbMATH DE number 1132342 |
Statements
High order moments of character sums (English)
0 references
24 March 1998
0 references
character sums
0 references
congruences
0 references
mean value estimate
0 references
0.846937894821167
0 references
0.8280878067016602
0 references
0.8220008611679077
0 references
0.8109463453292847
0 references
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.
0 references