Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms
From MaRDI portal
Publication:2456541
DOI10.1016/J.JSC.2004.10.002zbMATH Open1121.33023OpenAlexW2030291354MaRDI QIDQ2456541FDOQ2456541
Authors: Mohamud Mohammed, Doron Zeilberger 
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2004.10.002
Cites Work
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Title not available (Why is that?)
- Decision procedure for indefinite hypergeometric summation
- Title not available (Why is that?)
- On Zeilberger's algorithm and its \(q\)-analogue
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- The method of creative telescoping
- A fast algorithm for proving terminating hypergeometric identities
- Title not available (Why is that?)
- When does Zeilberger's algorithm succeed?
Cited In (16)
- Creative telescoping for holonomic functions
- Trading order for degree in creative telescoping
- No-neighbours recurrence schemes for space-time Green's functions on a 3D simple cubic lattice
- Disturbing the Dyson conjecture, in a generally GOOD way
- The Abel lemma and the \(q\)-Gosper algorithm
- Proving hypergeometric identities by numerical verifications
- The Abel Lemma and the $q$-Gosper Algorithm
- On the length of integers in telescopers for proper hypergeometric terms
- An algorithm for deciding the summability of bivariate rational functions
- Extensions of the AZ-Algorithm and the Package MultiIntegrate
- NewZeil.m
- qZEILBERGER
- ZEILBERGER
- Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory
- New series representations for Jacobi's triple product identity and more via the \(q\)-Markov method
- Some open problems related to creative telescoping
Uses Software
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)
