Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms
From MaRDI portal
(Redirected from Publication:2456541)
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
Cites work
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- A fast algorithm for proving terminating hypergeometric identities
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Decision procedure for indefinite hypergeometric summation
- scientific article; zbMATH DE number 1023404 (Why is no real title available?)
- scientific article; zbMATH DE number 1131976 (Why is no real title available?)
- scientific article; zbMATH DE number 872231 (Why is no real title available?)
- On Zeilberger's algorithm and its \(q\)-analogue
- The method of creative telescoping
- When does Zeilberger's algorithm succeed?
Cited in
(17)- NewZeil.m
- On the length of integers in telescopers for proper hypergeometric terms
- An algorithm for deciding the summability of bivariate rational functions
- ZEILBERGER
- qZEILBERGER
- Some open problems related to creative telescoping
- Trading order for degree in creative telescoping
- Extensions of the AZ-Algorithm and the Package MultiIntegrate
- Creative telescoping for holonomic functions
- No-neighbours recurrence schemes for space-time Green's functions on a 3D simple cubic lattice
- The Abel Lemma and the q-Gosper Algorithm
- New series representations for Jacobi's triple product identity and more via the \(q\)-Markov method
- A unified reduction for hypergeometric and q-hypergeometric creative telescoping
- The Abel lemma and the \(q\)-Gosper algorithm
- Disturbing the Dyson conjecture, in a generally GOOD way
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- Proving hypergeometric identities by numerical verifications
This page was built for publication: Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456541)