Computing Hypergeometric Solutions of Linear Recurrence Equations

Authors:
Thomas Cluzeau;Mark van Hoeij
Affiliations:
LACO, University of Limoges, 123 avenue Albert Thomas, 87060, Limoges cedex, France;Department of mathematics, Florida State University, 123 avenue Albert Thomas, 32306, Tallahassee, FL, USA
Venue:
Applicable Algebra in Engineering, Communication and Computing
Year:
2006

Citing 0
Cited 6

Rational solutions of ordinary difference equations

Journal of Symbolic Computation
Liouvillian solutions of irreducible linear difference equations

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
On m-Interlacing Solutions of Linear Difference Equations

CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Liouvillian solutions of irreducible second order linear difference equations

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Solving recurrence relations using local invariants

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algorithmic determination of q-power series for q-holonomic functions

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularities and avoid computations in splitting fields. An implementation is available in Maple 9.