English
Related papers

Related papers: Character Sums Over The Prime Numbers

200 papers

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

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

Let $q$ be a prime power and $m>1$ be any integer. Let $\mathbb F_{q^m}$ be the finite field of order $q^m$ and $\theta\in\mathbb F_{q^m}$ be such that $\mathbb F_{q^m} = \mathbb F(\theta)$. We obtain a nontrivial bound for the mixed…

Number Theory · Mathematics 2026-03-03 Arpan Chandra Mazumder , Giorgos Kapetanakis , Sushant Kala , Dhiren Kumar Basnet

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

In this paper, we provide formulas for partial sums of weighted averages over regular integers modulo $n$ of the $\gcd$-sum function with any arithmetic function. Many interesting applications of the results are also given.

Number Theory · Mathematics 2021-05-26 Waseem Alass

We show that the binomial and related multiplicative character sums $$ \sum_{\stackrel{x=1}{(x,p)=1}}^{p^m} \chi (x^l(Ax^k +B)^w),\hspace{3ex} \sum_{x=1}^{p^m} \chi_1 (x)\chi_2(Ax^k +B), $$ have a simple evaluation for large enough $m$ (for…

Number Theory · Mathematics 2014-10-27 Vincent Pigno , Christopher Pinner

We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.

Number Theory · Mathematics 2016-09-23 Mohamed El Bachraoui

In this article, we study extreme values of quadratic character sums with multiplicative coefficients $\sum_{n \le N}f(n)\chi_d(n)$. For a positive number $N$ within a suitable range, we employ the resonance method to establish a…

Number Theory · Mathematics 2025-08-26 Zikang Dong , Zhonghua Li , Yutong Song , Shengbo Zhao

Let $\chi$ be a primitive character modulo $q$, and let $\delta > 0$. Assuming that $\chi$ has large order $d$, for any $d$th root of unity $\alpha$ we obtain non-trivial upper bounds for the number of $n \leq x$ such that $\chi(n) =…

Number Theory · Mathematics 2024-05-02 Alexander P. Mangerel , Yichen You

We consider sums of the form $$F_\chi(\alpha,\beta;\theta) := \sum_{\alpha p<n\le\beta p}\chi(n)e(n\theta),$$ where $\chi$ is a non-principal Dirichlet character modulo a prime number $p$. We prove that $$ \sqrt p \log \log p \ll \max_{0…

Number Theory · Mathematics 2026-05-14 Néo Tardy

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…

Number Theory · Mathematics 2025-03-20 Étienne Fouvry , Igor E. Shparlinski , Ping Xi

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…

Number Theory · Mathematics 2025-12-23 Rena Chu

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

Number Theory · Mathematics 2014-10-15 Bryce Kerr

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Number Theory · Mathematics 2026-01-19 Todd Cochrane , Andrew Granville , Junren Zheng

We establish new estimates on short character sums for arbitrary composite moduli with small prime factors. Our main result improves on the Graham-Ringrose bound for square free moduli and also on the result due to Gallagher and Iwaniec…

Number Theory · Mathematics 2014-05-09 Mei-Chu Chang

The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…

History and Overview · Mathematics 2017-02-28 Tanay Wakhare

We investigate the sums $(1/\sqrt{H}) \sum_{X < n \leq X+H} \chi(n)$, where $\chi$ is a fixed non-principal Dirichlet character modulo a prime $q$, and $0 \leq X \leq q-1$ is uniformly random. Davenport and Erd\H{o}s, and more recently…

Number Theory · Mathematics 2022-03-18 Adam J. Harper

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

Number Theory · Mathematics 2020-12-08 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

We consider the problem of $\Omega$ bounds for the partial sums of a modified character, \textit{i.e.}, a completely multiplicative function $f$ such that $f(p)=\chi(p)$ for all but a finite number of primes $p$, where $\chi$ is a primitive…

Number Theory · Mathematics 2023-04-26 Marco Aymone

In this paper, we study the Jacobi sums over Galois rings of arbitrary characteristics and completely determine their absolute values, which extends the work in \cite{feng1}, where the Jacobi sums over Galois rings with characteristics a…

Information Theory · Computer Science 2020-06-04 Dengming Xu