English
Related papers

Related papers: Character sums over Bohr sets

200 papers

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

Number Theory · Mathematics 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

Number Theory · Mathematics 2015-07-06 Daqing Wan , Qiang Wang

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…

Number Theory · Mathematics 2019-02-20 Igor E. Shparlinski

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

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…

Number Theory · Mathematics 2019-02-20 Igor Shparlinski

We establish estimates for short character sums to prime power moduli evaluated at binary quadratic forms. This complements estimates established by Heath-Brown for such character sums to squarefree moduli. Our approach uses $p$-adic…

Number Theory · Mathematics 2026-05-18 Stephan Baier , Aishik Chattopadhyay

In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Polya-Vinogradov…

Number Theory · Mathematics 2007-05-23 Andrew Granville , K. Soundararajan

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

We prove new bounds for sums of multiplicative characters over sums of set with small doubling and applying this result we break the square--root barrier in a problem of Balog concerning products of differences in a field of prime order.

Number Theory · Mathematics 2020-04-07 Tomasz Schoen , Ilya D. Shkredov

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

Group Theory · Mathematics 2013-09-17 Attila Maroti , Hung Ngoc Nguyen

We provide estimates for sums of the form \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\chi(a+b+c)\right|\] and \[\left|\sum_{a\in A}\sum_{b\in B}\sum_{c\in C}\sum_{d\in D}\chi(a+b+cd)\right|\] when $A,B,C,D\subset \mathbb F_p$, the field…

Number Theory · Mathematics 2015-09-16 Brandon Hanson

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…

Number Theory · Mathematics 2020-08-26 Lillian B. Pierce , Junyan Xu

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…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[\alpha n + \beta] : n =1,2,... \}$, where $\alpha,\beta\in\R$, and $\alpha$ is irrational. Our bounds are nontrivial over the same short…

Number Theory · Mathematics 2007-05-23 William D. Banks , Igor E. Shparlinski

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…

Number Theory · Mathematics 2014-05-21 Mei-Chu Chang , 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 prove a novel four-variable character sum identity which serves as a twisted, non-archimedean counterpart to Weber's integrals for Bessel functions. Using this identity and ideas from Venkatesh's thesis, we present a new, spectral proof…

Number Theory · Mathematics 2025-01-22 Chung-Hang Kwan , Wing Hong Leung

In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang.…

Number Theory · Mathematics 2016-06-02 Ilya D. Shkredov , Aleksei S. Volostnov

We obtain explicit estimates for the mixed character sum $S= S(\chi,g,f,p^m) = \sum_{x=1}^{p^m} \chi (g(x)) e_{p^m}(f(x))$, where $p^m$ is a prime power, $\chi$ is a multiplicative character mod $p^m$ and $f,g$ are rational functions over…

Number Theory · Mathematics 2026-04-06 Todd Cochrane , Andrew Granville

In this article, we investigate conditional large values of quadratic Dirichlet character sums. We prove some Omega results of quadratic character sums under the assumption of the generalized Riemnn hypothesis, which are as sharp as…

Number Theory · Mathematics 2025-09-10 Zikang Dong , Yanbin Zhang