Related papers: Multiple Exponential and Character Sums with Monom…

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 obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

We examine a family of three-dimensional exponential sums with monomials and provide estimates which are in some instances sharper than those stemming from approaches entailing the use of existing bounds pertaining to analogous sums.

We improve an existing result on exponential quadrilinear sums in the case of sums over multiplicative subgroups of a finite field and use it to give a new bound on exponential sums with quadrinomials.

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 propose a numerical method, based upon matrix-pencils, for the identification of parameters and coefficients of a monomial-exponential sum. We note that this method can be considered an extension of the numerical methods for the…

We estimate weighted character sums with determinants $ad-bc $ of $2\times 2$ matrices modulo a prime $p$ with entries $a,b,c,d $ varying over the interval $ [1,N]$. Our goal is to obtain nontrivial bounds for values of $N$ as small as…

The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…

We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…

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 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 $p$ be a prime. We prove bounds on short Dirichlet character sums evaluated at a class of homogeneous polynomials in arbitrary dimensions. In every dimension, this bound is nontrivial for sums over boxes with side lengths as short as…

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

We obtain new bounds on some trilinear and quadrilinear character sums, which are non-trivial starting from very short ranges of the variables. An application to an apparently new problem on oscillations of characters on differences between…

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

We obtain new bounds on complete rational exponential sums with sparse polynomials modulo a prime, under some mild conditions on the degrees of the monomials of such polynomials. These bounds, when they apply, give explicit versions of a…

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)$.…

A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.