Search arXivSearch

arXiv · 2609.06168

Terminating Zero-Balanced Hypergeometric Series Using Divided Differences

Abstract

There is a close relationship between divided differences and hypergeometric series, and recent studies have shown that divided differences can be used effectively to derive terminating hypergeometric identities. In this paper, we apply this approach to terminating zero-balanced hypergeometric series. Using explicit product evaluations arising from divided differences, we give alternative proofs of zero-balanced ${}_3F_2(1)$ and ${}_4F_3(1)$ summation formulas and then extend the argument to the general terminating ${}_{r+1}F_r(1)$ case. We also combine the Lagrange representation with the Leibniz rule for divided differences to derive a finite convolution transformation for a terminating ${}_{r+2}F_{r+1}(1)$ series. Thus, the divided-difference approach not only reproduces the known zero-balanced summation formulas but also yields a finite convolution transformation for terminating hypergeometric series, together with its zero-balanced specialization.

Explore related subjects

Keep this discovery

BibTeXRIS

Fatma Zürnacı Yetiş. 2026-09-05. Terminating Zero-Balanced Hypergeometric Series Using Divided Differences. https://arxiv.org/abs/2609.06168

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Eigenvalues and eigenfunctions of the fractional Laplacian on the interval

We prove a three-term asymptotic formula for the eigenvalues of the fractional Laplacian on the bounded interval $(-1,1)$. This improves the eigenvalue asymptotics of Kulczycki--Kwaśnicki--Małecki--Stós and Kwaśnicki, and confirms the conjectural $O_α(n^{-2})$ remainder suggested by the numerical simulations of Kaleta--Kwaśnicki--Małecki. Moreover, we prove that the normalized eigenfunctions are bounded uniformly in the eigenvalue index $n$ and the fractional order $α$. This settles the conjecture proposed by Kwaśnicki through numerical experiments. Furthermore, we prove that the $n$-th eigenfunction has exactly $n-1$ zeros in the interval $(-1,1)$ and every zero is simple, and hence there are exactly $n$ nodal domains. A key ingredient in the proof is an explicit representation of the eigenfunction.

math.CA

Mathematical and numerical analysis of quantum signal processing

Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of quantum singular value transformation (QSVT), which is often regarded as one of the most important quantum algorithms of the past decade, with a wide range of applications in scientific computing, from Hamiltonian simulation to solving linear systems of equations and eigenvalue problems. In this article we survey recent advances in the mathematical and numerical analysis of QSP. In particular, we focus on its generalization beyond polynomials, the computational complexity of algorithms for phase factor evaluation, and the numerical stability of such algorithms. The resolution to some of these problems relies on an unexpected interplay between QSP, nonlinear Fourier analysis on $\mathrm{SU}(2)$, fast polynomial multiplications, and Gaussian elimination for matrices with displacement structure.

quant-ph

On the well-posedness and efficient approximation for the classical Melan equation in suspension bridges

The classical Melan equation modeling suspension bridges is considered. We first study the explicit expression and global properties of the analytical solution for the simplified ``less stiff'' model, based on which we derive an a priori estimate for the original classical Melan equation and establish, under an explicit load condition, that it has a unique solution with nonnegative integral under downward live loads, thereby showing the uniqueness of the corresponding deflection curve in the engineering setting. We also develop an efficient iterative approximation method by taking the solution of the simplified ``less stiff'' model as the first iterate, and prove its geometric convergence with explicit error estimates. The applicability and computational efficiency of the method are demonstrated through calculations for two actual bridges, which also quantify the influence of the nonlinear nonlocal term on the solution and clarify the relationship between the simplified and original models. Several engineering observations are verified and explained, and some related open problems are suggested.

math.NA