Yongjae Cha
Abstract
We will present an implementation of several algorithms for solving second order linear recurrence relations. The algorithms are described in two papers accepted at ISSAC 2010. Our implementation can find Liouvillian solutions, as well as solutions written in terms of values of special functions such as the 2F1 hypergeometric function, Bessel, Whittaker, Legendre, Laguerre, etc.
We have done an automated search in Sloane's online encyclopedia of integer sequences, to find sequences that satisfy a second order recurrence. Our implementation solves a large majority of such recurrence relations. The papers and implementation are available at http://www.math.fsu.edu/~glevy/implementation.
Index Terms
- Abstract only: Solving linear recurrence relations
Recommendations
The q-WZ method for infinite sums (abstract only)
We develop a q-WZ method for justifying nonterminating basic hypergeometric summation formulas by computing the WZ-pairs as certificates which may involve some infinite q-shifted factorials. Using this approach, we can verify a wide variety of classical ...
On factoring multi-variate polynomials over algebraically closed fields (abstract)
ISSAC '90: Proceedings of the international symposium on Symbolic and algebraic computationFor a problem how to find an extension field over which we can obtain an absolutely irreducible factor, Kaltofen gave an answer in 1983 and explicitly in 1985 by employing analytic argument for showing his answer, and Chistov and Grigor'ev also gave the ...
Solving multivariate linear recurrences in wedges (abstract only)
Many problems of combinatorial enumeration can be reduced to solving multivariate linear recurrences with constant coefficients in wedge-like domains. We survey some results on existence and uniqueness of solutions to such recurrences, on the algebraic ...
Comments