English
Related papers

Related papers: Applicability of the $q$-Analogue of Zeilberger's …

200 papers

Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a…

Number Theory · Mathematics 2026-03-30 Song-Xiao Li , Su-Dan Wang

The considered problem is uniform convergence of sequences of hypergeometric series. We give necessary and sufficient conditions for uniformly dominated convergence of infinite sums of proper bivariate hypergeometric terms. These conditions…

Classical Analysis and ODEs · Mathematics 2007-05-23 Raimundas Vidunas

The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this…

Symbolic Computation · Computer Science 2014-08-05 Shaoshi Chen , Manuel Kauers , Christoph Koutschan

For a hypergeometric series $\sum_k f(k,a, b, ...,c)$ with parameters $a, b, >...,c$, Paule has found a variation of Zeilberger's algorithm to establish recurrence relations involving shifts on the parameters. We consider a more general…

Classical Analysis and ODEs · Mathematics 2009-08-11 William Y. C. Chen , Qing-Hu Hou , Yan-Ping Mu

Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…

Combinatorics · Mathematics 2014-03-21 Thotsaporn Aek Thanatipanonda

Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for…

Symbolic Computation · Computer Science 2025-06-10 Shaoshi Chen , Christoph Koutschan , Yisen Wang

We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed…

Symbolic Computation · Computer Science 2012-11-14 Shaoshi Chen , Frédéric Chyzak , Ruyong Feng , Guofeng Fu , Ziming Li

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that $k$ is the summation index. By setting a parameter $x$ to $xq^n$, we may find a recurrence relation of the summation by using the…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Qing-Hu Hou , Yan-Ping Mu

We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…

Dynamical Systems · Mathematics 2007-05-23 Brian F. Martensen

We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…

Combinatorics · Mathematics 2007-06-13 David M. Bradley

Motivated by the telescoping proofs of two identities of Andrews and Warnaar, we find that infinite q-shifted factorials can be incorporated into the implementation of the q-Zeilberger algorithm in the approach of Chen, Hou and Mu to prove…

Combinatorics · Mathematics 2008-06-17 William Y. C. Chen , Ernest X. W. Xia

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

Symbolic Computation · Computer Science 2017-06-29 Shaoshi Chen

In this paper, we solve the existence problem of telescopers for rational functions in three discrete variables. We reduce the problem to that of deciding the summability of bivariate rational functions, which has been solved recently. The…

Symbolic Computation · Computer Science 2016-01-14 Shaoshi Chen , Qing-Hu Hou , George Labahn , Rong-Hua Wang

In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.

Combinatorics · Mathematics 2019-11-13 Rong-Hua Wang

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…

Symbolic Computation · Computer Science 2013-01-24 Shaoshi Chen , Ruyong Feng , Guofeng Fu , Ziming Li

In 1992, Wilf and Zeilberger conjectured that a hypergeometric term in several discrete and continuous variables is holonomic if and only if it is proper. Strictly speaking the conjecture does not hold, but it is true when reformulated…

Combinatorics · Mathematics 2019-01-18 Shaoshi Chen , Christoph Koutschan

We generalize a terminating summation formula to a unilateral nonterminating, and further, a bilateral summation formula by a property of analytic functions. The unilateral one is proved to be a $q$-analogue of a $_4F_3$-summation formula.…

Combinatorics · Mathematics 2021-06-30 Jun-Ming Zhu

This paper argues that automated proofs of identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalsch\"utz' summation formula in the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Tom H. Koornwinder

The second order hypergeometric q-difference operator is studied for the value c=-q. For certain parameter regimes the corresponding recurrence relation can be related to a symmetric operator on the Hilbert space l^2(Z). The operator has…

Classical Analysis and ODEs · Mathematics 2010-11-03 Erik Koelink

It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show…

Number Theory · Mathematics 2024-12-11 Charlene Kalle , Fanni M. Sélley , Jörg M. Thuswaldner
‹ Prev 1 2 3 10 Next ›