Stepanov's Method Applied to Binomial Exponential Sums

From MaRDI portal





Let \(p\) be a prime number, \(\mathbb{F}_{p}\) the prime finite field with \(p\) elements, and \(e_{p}(u)= \exp(2 \pi u/p)\) the additive character on \(\mathbb{F}_{p}\). For a binomial \(f(x)=ax^{k}+bx^{l}\) with \(1 \leq l < k < \frac{1}{32}(p-1)^{2/3}\), the authors consider the binomial exponential sum \[ S^{*}= \sum_{x=1}^{p-1}e_{p}(ax^{k}+bx^{l}), \qquad (ab,p)=1, \qquad 1 \leq l < k < p-1, \] and prove that \[ | S^{*}| \ll \max \{1, l \Delta^{-1/3} \}^{1/4} k^{1/4}p^{3/4}, \] where \( \Delta=(k-l)/(k,l,p-1)\). This gives an improvement of the classical Mordell and Weil bounds when \(p^{1/3} \ll k \ll p^{2/3}\), and extends the previous results of \textit{N. M. Akulinichev} [Sov. Math., Dokl. 161, 480--482 (1965); translation from Dokl. Akad. Nauk SSSR 161, 743--745 (1965; Zbl 0127.02102)], \textit{H. Yu} [Math. Proc. Camb. Philos. Soc., 131, 321--326 (2001; Zbl 0993.11040)], \textit{D. R. Heath-Brown} and \textit{S. Konyagin} [Q. J. Math. 51, No. 2, 221--235 (2000; Zbl 0983.11052)] concerning binomial and monomial exponential sums. A similar result is also proved for the slightly more general sums \[ S_{+} = \sum_{x=1}^{p-1} \chi(x) e_{p}(ax^{k}+bx^{l}), \qquad (ab,1)=1, \qquad 1 \leq l < k <p-1, \] and \[ S_{-} = \sum_{x=1}^{p-1} \chi(x) e_{p}(ax^{k}+bx^{-l}), \qquad (ab,p)=1, \quad 1 \leq l \leq k, \quad k+l < p-1., \] where \( \chi(x)\) is a multiplicative character of \(\mathbb{F}_{p}\).











This page was built for publication: Stepanov's Method Applied to Binomial Exponential Sums

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