An improved Mordell type bound for exponential sums (Q4825618)
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 2111814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved Mordell type bound for exponential sums |
scientific article; zbMATH DE number 2111814 |
Statements
An improved Mordell type bound for exponential sums (English)
0 references
28 October 2004
0 references
exponential sums
0 references
0.8995447754859924
0 references
0.888160228729248
0 references
0.874984860420227
0 references
0.8610292077064514
0 references
0.8608894348144531
0 references
The authors consider mixed exponential sums of the type \[ S(\chi ,f) = \sum_{x=1}^{p-1}\chi (x)e(f(x)/p), \] where \(p\) is a prime, \(\chi \) a multiplicative character \(\pmod{p}\), and \(f(x)=a_1x^{k_1}+ \dotsb + a_rx^{k_r}\) with \(p\nmid a_i\) and \(k_i \in \mathbb Z\). In the special case where \(\chi \) is trivial and \(1\leq k_1 < \cdots < k_r\), the bound \(2^{2/r}(k_1\dotsb k_r)^{1/r^2}p^{1-1/(2r)}\) for the modulus of the exponential sum is obtained. This improves a result of Mordell from 1932. A key ingredient of the argument is bounding the number of solutions of the system of congruences \[ \sum_{i=1}^r x_i^{k_j} \equiv \sum_{i=1}^ry_i^{k_j} \pmod{p}, \quad (x_iy_i,p)=1, \quad j=1,\dotsc , r. \]
0 references