Learn More
The goal in this paper is to find closed form solutions for linear recurrence equations, by transforming an input equation <i>L</i> to an equation <i>L</i><sub><i>s</i></sub> with known solutions. The main problem is how to find a solved equation <i>L</i><sub><i>s</i></sub> to which <i>L</i> can be reduced. We solve this problem by computing local data at(More)
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. The first algorithm for this was given by Hendriks in 1998, and Hendriks and Singer in 1999. Several improvements have been published, including a paper by Cha and van Hoeij that reduces the combinatorial problem. But the number of combinations still(More)
The software is an implementation of the algorithms in [1], [2], and [3]. The main algorithm from [3] is implemented with additional base equations beyond what appear in [3] and is incorporated into [4]. Common to each algorithm is a transformation from a base equation to the input using transformations that preserve order and homogeneity (referred to as(More)
  • 1