English
Related papers

Related papers: Binomial Character Sums Modulo Prime Powers

200 papers

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

Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.

Combinatorics · Mathematics 2007-05-23 Johann Cigler

For any $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Let $p$ be an odd prime. In this paper, we…

Number Theory · Mathematics 2020-12-09 Jia-Yu Chen , Chen Wang

For any positive integer $n$ and variables $a$ and $x$ we define the generalized Legendre polynomial $P_n(a,x)=\sum_{k=0}^n\b ak\b{-1-a}k(\frac{1-x}2)^k$. Let $p$ be an odd prime. In the paper we prove many congruences modulo $p^2$ related…

Number Theory · Mathematics 2012-02-02 Zhi-Hong Sun

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

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

Complex Variables · Mathematics 2008-04-15 Milan Janjic

We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…

Combinatorics · Mathematics 2020-12-07 Christian Krattenthaler , Carsten Schneider

Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…

Number Theory · Mathematics 2021-02-16 Michele Elia

In this paper we consider transformation formulas for \[ B\left( z,s:\chi\right) =\sum\limits_{m=1}^{\infty}\sum\limits_{n=0} ^{\infty}\chi(m)\chi(2n+1)\left( 2n+1\right) ^{s-1}e^{\pi im(2n+1)z/k}. \] We derive reciprocity theorems for the…

Number Theory · Mathematics 2016-08-08 Mümün Can , Veli Kurt

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m^2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we…

Number Theory · Mathematics 2019-08-15 Kathrin Bringmann , Ben Kane

We prove an estimate for multi-variable multiplicative character sums over affine subspaces of $\mathbb A^n_k$, which generalize the well known estimates for both classical Jacobi sums and one-variable polynomial multiplicative character…

Number Theory · Mathematics 2021-06-11 Antonio Rojas-León

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

Combinatorics · Mathematics 2022-08-03 Harold R. Parks , Dean C. Wills

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

General Mathematics · Mathematics 2025-08-05 Julius Stricker

Let $f$ be a holomorphic or Maass cusp forms for $ \rm SL_2(\mathbb{Z})$ with normalized Fourier coefficients $\lambda_f(n)$ and \bna r_{\ell}(n)=\#\left\{(n_1,\cdots,n_{\ell})\in \mathbb{Z}^2:n_1^2+\cdots+n_{\ell}^2=n\right\}. \ena Let…

Number Theory · Mathematics 2024-10-17 Yanxue Yu

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

Combinatorics · Mathematics 2017-09-22 Moa Apagodu

Bag and Shparlinski \cite{BaSh} considered bilinear sums of terms of the form $e_p(axy^s)$, where $p$ is a prime, $a$ is an integer coprime to $p$, $s$ is an integer, $x$ runs over a subset of $\mathbb{F}_p^{\ast}$ and $y$ runs over an…

Number Theory · Mathematics 2026-05-07 Stephan Baier

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

Number Theory · Mathematics 2020-07-21 Hai-Liang Wu
‹ Prev 1 4 5 6 7 8 10 Next ›