English
Related papers

Related papers: Binomial Character Sums Modulo Prime Powers

200 papers

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

We show that for any mod $p^m$ characters, $\chi_1, \dots, \chi_k,$ the Jacobi sum, $$ \sum_{x_1=1}^{p^m}\dots \sum_{\substack{x_k=1\\x_1+\dots+x_k=B}}^{p^m}\chi_1(x_1)\dots \chi_k(x_k), $$ has a simple evaluation when $m$ is sufficiently…

Number Theory · Mathematics 2014-10-24 Misty Long , Vincent Pigno , Christopher Pinner

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

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

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 $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Number Theory · Mathematics 2014-01-21 Ke Gong

Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…

Number Theory · Mathematics 2024-09-25 Kaimin Cheng , Shuhong Gao

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

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Number Theory · Mathematics 2024-08-22 Zubeyir Cinkir

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

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

For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$.…

Number Theory · Mathematics 2023-12-13 Neha Elizabeth Thomas , K Vishnu Namboothiri

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Number Theory · Mathematics 2009-11-06 Roberto Tauraso

Let $[x]$ be the integral part of $x$, $n>1$ be a positive integer and $\chi_n$ denote the trivial Dirichlet character modulo $n$. In this paper, we use an identity established by Z. H. Sun to get congruences of…

Number Theory · Mathematics 2022-11-30 Ni Li , Rong Ma

In this paper, we study the distribution of difference of multiplicative and additive characters modulo $p$ at consecutive polynomial values. More precisely, for an interval $I$ over finite field and $0<m<1$, we investigate the following…

Number Theory · Mathematics 2026-01-30 Nilanjan Bag , Dwaipayan Mazumder

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

We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.

Number Theory · Mathematics 2009-12-20 Roberto Tauraso

Let $q$ be a prime power and $r$ a positive even integer. Let $\mathbb{F}_{q}$ be the finite field with $q$ elements and $\mathbb{F}_{q^r}$ be its extension field of degree $r$. Let $\chi$ be a nontrivial multiplicative character of…

Number Theory · Mathematics 2025-05-12 Kaimin Cheng , Arne Winterhof

We improve a recent result of B. Hanson (2015) on multiplicative character sums with expressions of the type $a + b +cd$ and variables $a,b,c,d$ from four distinct sets of a finite field. We also consider similar sums with $a + b(c+d)$.…

Number Theory · Mathematics 2017-04-12 Ilya D. Shkredov , Igor E. Shparlinski

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
‹ Prev 1 2 3 10 Next ›