Constant-coefficient linear recurrence of order k: a_{n+k} + c_{k-1}a_{n+k-1} + … + c_0 a_n = 0. Ansatz a_n = λⁿ reduces the recurrence to the characteristic polynomial χ(λ) = λ^k + c_{k-1}λ^{k-1} + … + c_0 = 0. With distinct roots λ_1,…
Linear recurrence a_{n+k} + c_{k-1}a_{n+k-1} + ... = 0: characteristic-poly solution
Related concepts
- Finite-difference methods
- Generating function
- Binet F_n=(φⁿ−ψⁿ)/√5: F₅=5, F₁₀=55; recurrence residual 0
- Fibonacci recurrence (golden ratio)
- Born-von Karman 1D chain dispersion omega^2 = (4 K/m) sin^2(ka/2); linear-recurrence
- Widom scaling & critical exponents
- Scaling relations (computational catalysis)
- Clock genes and TTFL