English
Related papers

Related papers: Mixed character sums modulo prime powers

200 papers

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

In this article, we investigate large values of Dirichlet character sums with multiplicative coefficients $\sum_{n\le N}f(n)\chi(n)$. We prove an Omega result in the region $\exp((\log q)^{\frac12+\varepsilon})\le N\le\sqrt q$, where $q$ is…

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

We revisit the proposed equality between discrete Fourier transforms of $p$-adic $\Gamma_p$--values and $p$-adic $L$--derivatives for odd characters modulo a prime $p$. The clean identity is false in general. Building on Coleman reciprocity…

Number Theory · Mathematics 2025-08-13 Samuel Reid

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

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

The Burgess inequality is the best upper bound we have for the character sum $S_{\chi}(M,N) = \sum_{M<n\le M+N} \chi(n).$ Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for…

Number Theory · Mathematics 2015-03-13 Enrique Treviño

The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…

Number Theory · Mathematics 2014-09-05 Ghaith A. Hiary

Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We obtain nontrivial estimates for multiplicative character sums associated with the division polynomials…

Number Theory · Mathematics 2026-04-01 Subham Bhakta

Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…

Group Theory · Mathematics 2024-02-21 Mark L. Lewis , Quanfu Yan

We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod $p$ less than $p^{2/3 + 3/(4 \sqrt{e})+ \epsilon}$, and we give some…

Number Theory · Mathematics 2017-03-16 Marc Munsch , Tim Trudgian

Let $f$ be a complex valued function on a finite field $F$ such that $f(0) = 0$, $f(1) = 1$, and $|f(x)| = 1$ for $x \neq 0$. Cohn asked if it follows that $f$ is a nontrivial multiplicative character provided that $\sum_{x \in F} f(x)…

Number Theory · Mathematics 2007-05-23 Par Kurlberg

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

Number Theory · Mathematics 2018-10-16 M. Z. Garaev

Let K be a p-adic field, R the valuation ring of K, and P the maximal ideal of R. Let $Y subseteq R^{2}$ be a non-singular closed curve, and Y_{m} its image in R/P^{m} times R/P^{m}, i.e. the reduction modulo P^{m} of Y. We denote by Psi an…

Algebraic Geometry · Mathematics 2007-05-23 W. A. Zuniga-Galindo

In this paper, we consider sums of three generalized $m$-gonal numbers whose parameters are restricted to integers with a bounded number of prime divisors. With some restrictions on $m$ modulo $30$, we show that a density one set of…

Number Theory · Mathematics 2024-09-23 Soumyarup Banerjee , Ben Kane , Daejun Kim

An explicit formula for the quadratic mean value at $s=1$ of the Dirichlet $L$-functions associated with the odd Dirichlet characters modulo $f>2$ is known. Here we present a situation where we could prove an explicit formula for the…

Number Theory · Mathematics 2024-06-06 Stéphane Louboutin

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…

Number Theory · Mathematics 2023-03-10 Étienne Fouvry , Igor E. Shparlinski

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

Two conjectures, posed by Finch-Smith, Harrington, and Wong in a paper published in Integers in $2023$, are proven. Given a monic biquadratic polynomial $f(x) = x^4 + cx^2 + e$, we prove a formula for the sum of its distinct outputs modulo…

Number Theory · Mathematics 2023-09-26 Samer Seraj

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…

Number Theory · Mathematics 2025-11-11 Aishik Chattopadhyay