The automatic construction of pure recurrence relations

A method is presented for the construction of pure recurrence relations for functions related to generalized hyper-geometric functions. It is an improvement of a technique by Fasenmeyer, and is suitable for automatic computer programming. Our method has an easy geometrical interpretation and also gives a constructive proof for the existence of a pure recurrence relation.