Related papers: Binomial exponential sums

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 establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…

We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer $\nu\ne 0$, we also obtain new bounds on exponential sums with $\nu$-th powers of such…

We use an estimate of Aksoy Yazici, Murphy, Rudnev and Shkredov (2016) on the number of solutions of certain equations involving products and differences of sets in prime finite fields to give an explicit upper bound on trilinear…

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 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 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…

We obtain a new bound for incomplete Gauss sums modulo primes. Our argument falls under the framework of Vinogradov's method which we use to reduce the problem under consideration to bounding the number of solutions to two distinct systems…

We obtain an upper bound for the sum $\Phi_a(x) = \sum_{p\le x}1/(\tau(p+a))$, where $\tau(n)$ is the divisor function, $a\ge 1$ is a fixed integer, and $p$ run through primes up to $x$.

We extend some methods of bounding exponential sums of the type $\displaystyle\sum_{n\le N}e^{2\pi iag^n/p}$ to deal with the case when $g$ is not necessarily a primitive root. We also show some recent results of Shkredov concerning…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

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 give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…

In this paper, we pose lots of challenging conjectures on congruences for the sums involving binomial coefficients and Ap\'ery-like numbers modulo $p^3$, where $p$ is an odd prime.

We prove new bounds on bilinear forms with Kloosterman sums, complementing and improving a series of results by \'E. Fouvry, E. Kowalski and Ph. Michel (2014), V. Blomer, \'E. Fouvry, E. Kowalski, Ph. Michel and D. Mili\'cevi\'c (2017), E.…

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…

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

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…

The Ap\'ery polynomials are given by $$A_n(x)=\sum_{k=0}^n\binom nk^2\binom{n+k}k^2x^k\ \ (n=0,1,2,\ldots).$$ (Those $A_n=A_n(1)$ are Ap\'ery numbers.) Let $p$ be an odd prime. We show that…