On the \(q\)-analogue of Zeilberger's algorithm to rational functions

DOI10.1023/A:1007186703355zbMath0985.33014OpenAlexW1507420704MaRDI QIDQ5942051

No author found.

Publication date: 28 August 2001

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007186703355

zbMATH Keywords

\(q\)-analogue of Zeilberger's algorithm

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Basic hypergeometric functions (33D99) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items (5)

A direct algorithm to construct the minimal \(Z\)-pairs for rational functions. ⋮ Residues and telescopers for bivariate rational functions ⋮ On the existence of telescopers for mixed hypergeometric terms ⋮ On the existence of telescopers for rational functions in three variables ⋮ Efficient \(q\)-integer linear decomposition of multivariate polynomials

This page was built for publication: On the \(q\)-analogue of Zeilberger's algorithm to rational functions