Hypergeometric solutions of linear recurrences with polynomial coefficients
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Solving difference equations in finite terms
Journal of Symbolic Computation
Rational solutions of matrix difference equations: the problem of equivalence and factorization
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On solutions of linear functional systems
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Computing Hypergeometric Solutions of Linear Recurrence Equations
Applicable Algebra in Engineering, Communication and Computing
Apparent singularities of linear difference equations with polynomial coefficients
Applicable Algebra in Engineering, Communication and Computing
Search for Liouvillian solutions of linear recurrence equations in the MAPLE computer algebra system
Programming and Computing Software
On m-Interlacing Solutions of Linear Difference Equations
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Journal of Symbolic Computation
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
Closed form solutions of linear difference equations in terms of symmetric products
ACM Communications in Computer Algebra
Closed form solutions of linear difference equations in terms of symmetric products
Journal of Symbolic Computation
| Hi-index | 0.00 |
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contribution consists of two theorems that significantly reduce the number of combinations that the algorithm will check.