Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms

DOI10.1016/j.jsc.2004.10.002zbMath1121.33023OpenAlexW2030291354MaRDI QIDQ2456541

Doron Zeilberger, Mohamud Mohammed

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

zbMATH Keywords

hypergeometric functions\(q\)-analogSymbolic summation

Mathematics Subject Classification ID

Related Items (16)

Disturbing the Dyson conjecture, in a generally GOOD way ⋮ Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory ⋮ Some open problems related to creative telescoping ⋮ Trading order for degree in creative telescoping ⋮ No-neighbours recurrence schemes for space-time Green’s functions on a 3D simple cubic lattice ⋮ New series representations for Jacobi's triple product identity and more via the \(q\)-Markov method ⋮ On the length of integers in telescopers for proper hypergeometric terms ⋮ An algorithm for deciding the summability of bivariate rational functions ⋮ The Abel lemma and the \(q\)-Gosper algorithm ⋮ The Abel Lemma and the $q$-Gosper Algorithm ⋮ Proving hypergeometric identities by numerical verifications ⋮ NewZeil.m ⋮ ZEILBERGER ⋮ qZEILBERGER ⋮ Creative Telescoping for Holonomic Functions ⋮ Extensions of the AZ-Algorithm and the Package MultiIntegrate

Uses Software

• qZeil

Cites Work

• An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
• A fast algorithm for proving terminating hypergeometric identities
• The method of creative telescoping
• On Zeilberger's algorithm and its \(q\)-analogue
• When does Zeilberger's algorithm succeed?
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Decision procedure for indefinite hypergeometric summation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms