English
Related papers

Related papers: On a generalization of Jacobi sums

200 papers

In this paper, we obtain analogues of Jacobi's derivative formula in terms of the theta constants with rational characteristics. For this purpose, we use the arithmetic formulas of the number of representations of a natural number…

Number Theory · Mathematics 2014-11-14 Kazuhide Matsuda

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Number Theory · Mathematics 2010-10-25 Leo Goldmakher

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 prove a stratification result for certain families of $n$-dimensional (complete algebraic) multiplicative character sums. The character sums we consider are sums of products of $r$ multiplicative characters evaluated at rational…

Number Theory · Mathematics 2017-09-07 Junyan Xu

In this paper we present a generalization of Faulhaber's formula to sums of arbitrary complex powers $m\in\mathbb{C}$. These summation formulas for sums of the form $\sum_{k=1}^{\lfloor x\rfloor}k^{m}$ and $\sum_{k=1}^{n}k^{m}$, where…

Number Theory · Mathematics 2021-03-16 Raphael Schumacher

We present a constructive proof of Jacobi's identity for the sum of two squares. We present a combinatorial proof of the Jacobi Triple Product and combine with a proof of Hirschhorn to define an algorithm. The input is a factorization…

Combinatorics · Mathematics 2019-07-16 Mario DeFranco

The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…

High Energy Physics - Phenomenology · Physics 2007-05-23 Sanjay K. Ghosh , Sibaji Raha

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

Number Theory · Mathematics 2018-08-31 Rustem R. Aidagulov , Max A. Alekseyev

In this contribution, we introduce the multiplicative Jacobi polynomials that arise as one of the solutions of the multiplicative Sturm-Liouville equation \begin{equation*} \frac{d^*}{dx}\left( e^{(1-x^2)\omega(x)}\odot \frac{d^*y}{dx}…

Classical Analysis and ODEs · Mathematics 2024-10-03 Edinson Fuentes , Luis E. Garza , Fabián Velázquez C

In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…

Combinatorics · Mathematics 2025-08-19 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki

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 obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

Number Theory · Mathematics 2023-10-24 Siddharth Iyer , Igor Shparlinski

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

The aim of this paper is twofold. The first is to give a quantitative version of Schmidt's subspace theorem for arbitrary families of higher degree polynomials. The second is to give a generalization of the subspace theorem for arbitrary…

Number Theory · Mathematics 2023-08-01 Si Duc Quang

We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.

Combinatorics · Mathematics 2007-05-23 Michel Lassalle

A generalization of the q-(Pfaff)-Saalschutz summation formula is proved. This implies a generalization of the Burge transform, resulting in an additional dimension of the ``Burge tree''. Limiting cases of our summation formula imply the…

Quantum Algebra · Mathematics 2007-05-23 A. Schilling , S. O. Warnaar

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

Number Theory · Mathematics 2017-05-17 Paolo Leonetti , Andrea Marino

In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $\mathbb{F}_q$ and $\mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of…

Combinatorics · Mathematics 2021-07-13 Himadri Shekhar Chakraborty , Tsuyoshi Miezaki

In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…

Number Theory · Mathematics 2022-11-02 Jean-Christophe Pain

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Mathematical Physics · Physics 2007-05-23 Mark W. Coffey