English
Related papers

Related papers: Double Character Sums over Subgroups and Intervals

200 papers

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…

Number Theory · Mathematics 2026-04-17 Aishik Chattopadhyay

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

Number Theory · Mathematics 2019-08-15 Brandon Hanson

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

For integer $q$, let $\chi$ be a primitive multiplicative character$\pmod q.$ For integer $a$ coprime to $q$, we obtain a new bound for the sums $$\sum_{n\le N}\Lambda(n)\chi(n+a),$$ where $\Lambda(n)$ is the von Mangoldt function. This…

Number Theory · Mathematics 2013-09-25 Bryce Kerr

Given a Dirichlet character $\chi$ modulo $q$ and its associated $L$-function, $L(s,\chi)$, we provide an explicit version of Burgess' estimate for $|L(s, \chi)|$. We use partial summation to provide bounds along the vertical lines $\Re{s}…

Number Theory · Mathematics 2022-06-24 Forrest J. Francis

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…

Number Theory · Mathematics 2023-10-24 Siddharth Iyer , Igor Shparlinski

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

Number Theory · Mathematics 2016-05-25 Igor E. Shparlinski

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

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

Number Theory · Mathematics 2021-12-24 Andrew Granville , Alexander P. Mangerel

We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.

Number Theory · Mathematics 2014-03-13 Vincent Pigno , Chris Pinner , Joe Sheppard

Let $g \geq 3$ be fixed and odd, and for large $q$ let $\chi$ be a primitive Dirichlet character modulo $q$ of order $g$. Conditionally on GRH we improve the existing upper bounds in the P\'{o}lya-Vinogradov inequality for $\chi$, showing…

Number Theory · Mathematics 2025-06-23 Alexander P. Mangerel

We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,\chi)$ of moduli $q$ and primitive…

Number Theory · Mathematics 2017-06-13 Igor E. Shparlinski

Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) =…

We prove, in particular, that if A,G are two arbitrary multiplicative subgroups of the prime field f_p, |G| < p^{3/4} such that the difference A-A is contained in G then |A| \ll |\G|^{1/3+o(1)}. Also, we obtain that for any eps>0 and a…

Number Theory · Mathematics 2015-08-18 Ilya D. Shkredov

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…

Number Theory · Mathematics 2014-12-30 Igor E Shparlinski , Katherine E. Stange

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

Number Theory · Mathematics 2011-07-01 Youness Lamzouri

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.

Number Theory · Mathematics 2015-06-12 D. R. Heath-Brown , L. B. Pierce

In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for primitive characters. Given a primitive character $\chi$ modulo $q$, we prove the following upper bound \begin{align*} \left| \sum_{1 \le n\le…

Number Theory · Mathematics 2020-01-16 Matteo Bordignon

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…

Number Theory · Mathematics 2021-05-27 Lillian B. Pierce

Let $M=M_1 M_2 M_3$ be the product of three distinct primes and let $\chi=\chi_1 \chi_2 \chi_3$ be a Dirichlet character of modulus $M$ such that each $\chi_i$ is a primitive character modulo $M_i$ for $i=1,2,3$. In this paper, we provide a…

Number Theory · Mathematics 2014-09-15 Roman Holowinsky , Ritabrata Munshi , Zhi Qi