The extended Zeilberger algorithm with parameters

DOI10.1016/J.JSC.2011.12.024zbMATH Open1305.33035arXiv0908.1328OpenAlexW1986292888MaRDI QIDQ413409FDOQ413409

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)

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.

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)

Cites Work

• Representations of orthogonal polynomials
• Title not available (Why is that?)
• Decision procedure for indefinite hypergeometric summation
• An extension of Zeilberger's fast algorithm to general holonomic functions
• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• The method of creative telescoping
• Summation in Finite Terms
• Title not available (Why is that?)
• Algorithms for \(q\)-hypergeometric summation in computer algebra
• 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
• Title not available (Why is that?)
• Solving parameterized linear difference equations in terms of indefinite nested sums and products

Cited In (15)

• Quasi-orthogonality of some hypergeometric and \(q\)-hypergeometric polynomials
• Recurrence relations for the connection coefficients of classical orthogonal polynomials
• On two-term hypergeometric recursions with free lower parameters
• Formal residue and computer-assisted proofs of combinatorial identities
• Contiguous Relations and Creative Telescoping
• Gosper summability of rational multiples of hypergeometric terms
• The interlacing properties of generalized Narayana polynomials
• Recurrences for Callan's generalization of Narayana polynomials
• Numerical computations of separability probabilities
• Reduction for congruences of partial sums of P-recursive sequences
• Polynomial reduction and supercongruences
• Deconstructing the Zeilberger algorithm^†
• Applicability of the \(q\)-analogue of Zeilberger's algorithm
• Title not available (Why is that?)
• Inner bounds for the extreme zeros of ₃F₂ hypergeometric polynomials

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)