Algorithms for \(q\)-hypergeometric summation in computer algebra (Q1971738)

The paper describes (theory and implementation in Maple) three algorithms for \(q\)-hypergeometric summation. The first one is a multibasic analogue of Gosper's algorithm. The second is a \(q\)-Zeilberger type algorithm. The third one is designed to find \(q\)-hypergeometric solutions of linear recurrences. Applications to \(q\)-analogous of classical orthogonal polynomials are also presented. For example the connection coefficients between families of \(q\)-Askey-Wilson polynomials are computed. The Maple package is the first one which combines all the algorithms which are useful tools to deal with problems associated with \(q\)-hypergeometric series.