Abstract
Linear recurrences with constant coefficients are an interesting class of recurrence equations that can be solved explicitly. The most famous example are certainly the Fibonacci numbers with the equation f(n) = f(n-1) + f(n - 2) and the quite non-obvious closed form (φ^{n} - (-φ)^{-n}) / √5 where φ is the golden ratio.
In this work, I build on existing tools in Isabelle – such as formal power series and polynomial factorisation algorithms – to develop a theory of these recurrences and derive a fully executable solver for them that can be exported to programming languages like Haskell.
License
Topics
Session Linear_Recurrences
- RatFPS
- Pochhammer_Polynomials
- Linear_Recurrences_Misc
- Partial_Fraction_Decomposition
- Factorizations
- Rational_FPS_Solver
- Linear_Recurrences_Common
- Linear_Homogenous_Recurrences
- Eulerian_Polynomials
- Linear_Inhomogenous_Recurrences
- Rational_FPS_Asymptotics