Related papers: Creative Telescoping for Hypergeometric Double Sum…
We develop a theoretical study of non-terminating hypergeometric summations with one free parameter. Composing various methods in complex and asymptotic analysis, geometry and arithmetic of certain transcendental curves and rational…
In 2021, the first author and Kalita obtained two general hypergeometric formulas for sums involving certain rising factorials to prove some supercongruence conjectures of Guo related to (B.2) and (C.2). In this paper, we further generalize…
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…
We introduce several new identities combining basic hypergeometric sums and integrals. Such identities appear in the context of superconformal index computations for three-dimensional supersymmetric dual theories. We give both analytic…
We offer some summation formulas that appear to have great utility in probability theory. The proofs require some recent results from analysis that have thus far been applied to basic hypergeometric functions.
Creative telescoping is a powerful computer algebra paradigm -initiated by Doron Zeilberger in the 90's- for dealing with definite integrals and sums with parameters. We address the mixed continuous-discrete case, and focus on the…
Take a multiplicative monoid of sequences in which the multiplication is given by Hadamard product. The set of linear combinations of interleaving monoid elements then yields a ring. For hypergeometric sequences, the resulting ring is a…
The two most commonly used hypergeometric functions are the confluent hypergeometric function and the Gauss hypergeometric function. We review the available techniques for accurate, fast, and reliable computation of these two hypergeometric…
We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…
We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general…
We propose hypergeometric constructions of simultaneous approximations to polylogarithms. These approximations suit for computing the values of polylogarithms and satisfy 4-term Apery-like (polynomial) recursions.
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The ubiquity of the class of D-finite functions and P-recursive sequences in symbolic computation is widely recognized. In this thesis, the presented work consists of two parts related to this class. In the first part, we generalize the…
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…
A new method for solving systems of linear algebraic equations of a special type arising in solving problems of image reconstruction has been proposed. This method, due to a certain symmetry of the matrix and the choice of the voxel…
We establish some new bilateral double-sum Rogers-Ramanujan identities involving parameters. As applications, these identities yield several new multi-sum Rogers-Ramanujan type identities. Our proofs utilize the theory of basic…
We produce two-dimensional contiguous relations for generalized hypergeometric functions by starting with linearization coefficients for some continuous generalized hypergeometric orthogonal polynomials in the Askey-scheme.
Multidimensional matrix inversions provide a powerful tool for studying multiple hypergeometric series. In order to extend this technique to elliptic hypergeometric series, we present three new multidimensional matrix inversions. As…
A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is shown that this algorithm is suitable in practical informatics…
Creative telescoping is the method of choice for obtaining information about definite sums or integrals. It has been intensively studied since the early 1990s, and can now be considered as a classical technique in computer algebra. At the…