The extended Zeilberger algorithm with parameters

DOI10.1016/J.JSC.2011.12.024MaRDI QIDQ413409zbMATH OpenOpenAlexFDO

Authors William Y. C. Chen, Qing-Hu Hou, Yan-Ping Mu

Publication date 7 May 2012

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0908.1328

zbMATH Keywords

hypergeometric seriesorthogonal polynomialsZeilberger's algorithmGosper's algorithmsymbolic summation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Basic hypergeometric functions in one variable, ({}_rphi_s) (33D15) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Hypergeometric functions (33C99)

Abstract: For a hypergeometric series $su{m}_{k}f(k,a,b,\mathrm{...},c)$ with parameters $a,b,>\mathrm{...},c$, Paule has found a variation of Zeilberger's algorithm to establish recurrence relations involving shifts on the parameters. We consider a more general problem concerning several similar hypergeometric terms $f_1(k,a,b,\mathrm{...},c)$, $f_2(k,a,b,\mathrm{...},c)$, $\mathrm{...}$, $f_m(k,a,b,\mathrm{...},c)$. We present an algorithm to derive a linear relation among the sums $su{m}_k{f}_i(k,a,b,\mathrm{...},c)$ $(1leqileqm)$. Furthermore, when the summand $f_i$ contains the parameter $x$, we can require that the coefficients be $x$-free. Such relations with $x$-free coefficients can be used to determine whether a polynomial sequence satisfies the three term recurrence and structure relations for orthogonal polynomials. The $q$-analogue of this approach is called the extended $q$-Zeilberger's algorithm, which can be employed to derive recurrence relations on the Askey-Wilson polynomials and the $q$-Racah polynomials.

Recommendations

• Algorithms for \(m\)-fold hypergeometric summation
• Applicability of the \(q\)-analogue of Zeilberger's algorithm
• An extension of Zeilberger's fast algorithm to general holonomic functions
• scientific article; zbMATH DE number 1504574
• On homogeneous Zeilberger recurrences

Cites work

• scientific article; zbMATH DE number 194092 (Why is no real title available?)
• scientific article; zbMATH DE number 1330281 (Why is no real title available?)
• scientific article; zbMATH DE number 1023404 (Why is no real title available?)
• Algorithms for \(q\)-hypergeometric summation in computer algebra
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• An extension of Zeilberger's fast algorithm to general holonomic functions
• Decision procedure for indefinite hypergeometric summation
• Extended Zeilberger's algorithm for identities on Bernoulli and Euler polynomials
• Pfaff's method. I: The Mills-Robbins-Rumsey determinant.
• Pfaff's method. III: Comparison with the WZ method
• Representations of orthogonal polynomials
• Solving parameterized linear difference equations in terms of indefinite nested sums and products
• Summation in Finite Terms
• The method of creative telescoping

Cited in

(21)

• Quasi-orthogonality of some hypergeometric and \(q\)-hypergeometric polynomials
• On homogeneous Zeilberger recurrences
• Recurrence relations for the connection coefficients of classical orthogonal polynomials
• On two-term hypergeometric recursions with free lower parameters
• SIMPLIFYING SUMS IN ΠΣ*-EXTENSIONS
• Inner bounds for the extreme zeros of \(_3F_2\) hypergeometric polynomials
• Formal residue and computer-assisted proofs of combinatorial identities
• Gosper summability of rational multiples of hypergeometric terms
• A definite summation of hypergeometric terms of special kind
• Parameterized telescoping proves algebraic independence of sums
• The interlacing properties of generalized Narayana polynomials
• Linear recurrence relations for sums of products of two terms
• Numerical computations of separability probabilities
• Recurrences for Callan's generalization of Narayana polynomials
• Reduction for congruences of partial sums of P-recursive sequences
• Creative telescoping for hypergeometric double sums
• Polynomial reduction and supercongruences
• Deconstructing the Zeilberger algorithm^†
• Applicability of the \(q\)-analogue of Zeilberger's algorithm
• Contiguous relations and creative telescoping
• scientific article; zbMATH DE number 6917125 (Why is no real title available?)

Describes a project that uses

Uses Software

• qZeil

This page was built for publication: The extended Zeilberger algorithm with parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413409)