A Mathematica q-Analogue of Zeilberger ’ s Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping

@inproceedings{Paule1991AMQ,
  title={A Mathematica q-Analogue of Zeilberger ’ s Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping},
  author={Peter Paule},
  year={1991}
}
Mathematica implementations, available by email request, of q-analogues of Gosper’s and Zeilberger’s algorithm are described. Nontrivial examples are given in order to illustrate the usage of these packages. The algorithms are based on a new approach to q-hypergeometric telescoping in which a new algebraic concept, q-greatest factorial factorization (qGFF), plays a fundamental role. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

The Theory of Partitions, Encyclopedia of Mathematics and its Appli

  • G. E. Andrews
  • 1976
Highly Influential
9 Excerpts

Identities and their computer proofs, \SPICE" lecture

  • H. S. Wilf
  • 1993

1992b] An algorithmic proof theory for hypergeometric (ordinary

  • H. S. Wilf, D. Zeilberger
  • 1992

Hypergeometric solutions of linear recurrences with polynomial coe cients

  • M. Petkov sek
  • 1992

An algebraically derived q - analog of a character sum associated with a class of semiregular permutations

  • D. M. Bressoud
  • Pac . J . Math .
  • 1990

An algebraically derived q-analog of a character sum

  • G. E. Andrews, D. M. Jackson
  • 1990

Similar Papers

Loading similar papers…