When does Zeilberger's algorithm succeed?
From MaRDI portal
Publication:1408263
DOI10.1016/S0196-8858(02)00504-3zbMATH Open1030.33011MaRDI QIDQ1408263FDOQ1408263
Authors: S. A. Abramov 
Publication date: 15 September 2003
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 2151211
- A criterion for the applicability of Zeilberger's algorithm to rational functions
- Applicability of the \(q\)-analogue of Zeilberger's algorithm
- A two-line algorithm for proving terminating hypergeometric identities
- scientific article; zbMATH DE number 1504574
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Rational normal forms and minimal decompositions of hypergeometric terms
- The method of creative telescoping
- On the structure of multivariate hypergeometric terms.
- Rational summation and Gosper-Petkovšek representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of prehomogeneous vector spaces (algebraic part)—the English translation of Sato’s lecture from Shintani’s note
- Minimal decomposition of indefinite hypergeometric sums
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Creative telescoping for holonomic functions
- Residues and telescopers for bivariate rational functions
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
- How to generate all possible rational Wilf-Zeilberger pairs?
- Proof of the Wilf-Zeilberger conjecture for mixed hypergeometric terms
- Computer proofs of a new family of harmonic number identities.
- Integral Representation and Algorithms for Closed Form Summation
- Title not available (Why is that?)
- Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱
- Constructing minimal telescopers for rational functions in three discrete variables
- On the existence of telescopers for mixed hypergeometric terms
- Telescopers for differential forms with one parameter
- On the existence of telescopers for rational functions in three variables
- Parameterized telescoping proves algebraic independence of sums
- Telescoping in the context of symbolic summation in Maple
- Linear differential equations as a data structure
- Deconstructing the Zeilberger algorithm†
- Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences
- Applicability of the \(q\)-analogue of Zeilberger's algorithm
- Some open problems related to creative telescoping
- On the order of the recurrence produced by the method of creative telescoping
This page was built for publication: When does Zeilberger's algorithm succeed?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408263)
