Related papers: On Bilinear Exponential and Character Sums with Re…

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

We prove non-trivial bounds for general bilinear forms in hyper-Kloosterman sums when the sizes of both variables may be below the P\'olya-Vinogradov range. We then derive applications to the second moment of holomorphic cusp forms twisted…

Inspired by the work of Bourgain and Garaev (2013), we provide new bounds for certain weighted bilinear Kloosterman sums in polynomial rings over a finite field. As an application, we build upon and extend some results of Sawin and…

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

We prove non-trivial upper bounds for general bilinear forms with trace functions of bountiful sheaves, where the supports of two variables can be arbitrary subsets in $\mathbf{F}_p$ of suitable sizes. This essentially recovers the…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

In recent years, there has been a lot of progress in obtaining non-trivial bounds for bilinear forms of Kloosterman sums in $\mathbb{Z}/m\mathbb{Z}$ for arbitrary integers $m$. These results have been motivated by a wide variety of…

We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…

We give new bounds for $\sum_{{a, m ,n}}\alpha_{m}\beta_n\nu_a {\textrm e}\left(\frac{a\overline m}{n}\right)$ where $\alpha_{m}$, $\beta_n$ and $\nu_a$ are arbitrary coefficients, improving upon a result of Duke, Friedlander and Iwaniec…

We obtain nontrivial estimates of quadratic character sums of division polynomials $\Psi_n(P)$, $n=1,2, ...$, evaluated at a given point $P$ on an elliptic curve over a finite field of $q$ elements. Our bounds are nontrivial if the order of…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

We obtain several estimates for bilinear form with exponential sums with binomials $mx^k + nx^\ell$. In particular we show the existence of nontrivial cancellations between such sums when the coefficients $m$ and $n$ vary over rather sparse…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…