NewZeil.m

swMATH6646MaRDI QIDQ18733

No author found.

Described by source

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

Related Items (8)

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 ⋮ 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 ⋮ Proving hypergeometric identities by numerical verifications

This page was built for software: NewZeil.m