2024/08/22 by Glenn Bruda, Bruda, Glenn, Bruce Fang +15
Computer Science · Mathematics · #11B37 #11B39 #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Matrix Theory and Algorithms
paper · pdf · doi:10.48550/arxiv.2408.12660
openalex publication_date 2024/08/22 · openalex created_date 2024/09/21 · openalex updated_date 2026/07/28
Given a linear recurrence of the form cn=a1cn-1+⋯+aj cn-j, it is well-known that cn=∑rpr(n)rn, where the sum is taken over the set of characteristic roots and each pr(n) is some polynomial. We give a closed formula for the coefficients of each polynomial pr(n) for any linear recurrence of this form.