Related papers: Character sums with Beatty sequences on Burgess-ty…

In this work we establish a Burgess bound for short multiplicative character sums in arbitrary dimensions, in which the character is evaluated at a homogeneous form that belongs to a very general class of "admissible" forms. This…

We obtain a Burgess-type bound for character sums over unions of intervals. The result follows from the argument of Heath-Brown, with an improvement in one of the steps.

We study sums with multiplicative functions that take values over a non-homogenous Beatty sequence. We then apply our result in a few special cases to obtain asymptotic formulas such as the number of integers in a Beatty sequence…

Let $k \ge 2$ and $\alpha_1, \beta_1, ..., \alpha_k, \beta_k$ be reals such that the $\alpha_i$'s are irrational and greater than 1. Suppose further that some ratio $\alpha_i/\alpha_j$ is irrational. We study the representations of an…

This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at…

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…

We prove that Burgess's bound gives an estimate not just for a single character sum, but for a mean value of many such sums.

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…

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.

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.

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…

This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov's mean value theorem into a version of the Burgess method.

We establish Burgess-type bounds for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$ under a purely volumetric condition. We show that for a box $B \subset \mathbb{F}_{p^n}$, nontrivial cancellation occurs whenever…

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…

We extend the classical Burgess estimates to character sums over proper generalized arithmetic progressions (GAPs) of rank $2$ in prime fields $\mathbb{F}_p$. The core of our proof is a sharp upper bound for the multiplicative energy of…

We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

We establish a new bound for short character sums in finite fields, particularly over two-dimensional grids in $\mathbb{F}_{p^3}$ and higher-dimensional lattices in $\mathbb{F}_{p^d}$, extending an earlier work of Mei-Chu Chang on Burgess…

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

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