Related papers: The Extended Zeilberger's Algorithm with Parameter…
Guillera has introduced remarkable series expansions for $\frac{1}{\pi^2}$ of convergence rates $-\frac{1}{1024}$ and $-\frac{1}{4}$ via the Wilf-Zeilberger method. Through an acceleration method based on Zeilberger's algorithm and related…
Hypergeometric sequences obey first-order linear recurrence relations with polynomial coefficients and are commonplace throughout the mathematical and computational sciences. For certain classes of hypergeometric sequences, we prove linear…
We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…
We show that multiple orthogonal polynomials for r measures $(\mu_1,...,\mu_r)$ satisfy a system of linear recurrence relations only involving nearest neighbor multi-indices $\vec{n}\pm \vec{e}_j$, where $\vec{e}_j$ are the standard unit…
We extend Gegenbauer Polynomials technique to evaluate a class of complicated Feynman diagrams. New results in the form of $_3F_2$-hypergeometrical series of unit argument, are presented. As a by-product, we present a new transformation…
Given a Feynman parameter integral, depending on a single discrete variable $N$ and a real parameter $\epsilon$, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in $\epsilon$. In a…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, a hypergeometric sequence $\langle u_n \rangle_{n=0}^{\infty}$ is one that satisfies a…
In PRL 115, 143001 (2015), H. Mera et al. developed a new simple but precise Hypergeometric Resummation technique. In this work, we suggest to obtain half of the parameters of the Hypergeometric function from the strong coupling expansion…
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…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
We give a method to embed the q-series in a (p,q)-series and derive the corresponding (p,q)-extensions of the known q-identities. The (p,q)-hypergeometric series, or twin-basic hypergeometric series (diferent from the usual bibasic…
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…
Without Borel or Pad$\acute{e}$ techniques, we show that for a divergent series with $n!$ large-order growth factor, the set of Hypergeometric series $_{k+1}F_{k-1}$ represents suitable approximants for which there exist no free parameters.…
In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…
The Kaczmarz algorithm is an iterative method for solving a system of linear equations. It can be extended so as to reconstruct a vector $x$ in a (separable) Hilbert space from the inner-products $\{\langle x, \phi_{n} \rangle\}$. The…
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…
We continue our study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we apply the approach of obtaining iteratated solutions to…