2012/01/03 by Deepak Ponvel Chermakani, Chermakani, Deepak Ponvel
Computer Science · Mathematics · #Applied mathematics #Combinatorics #Discrete Mathematics (cs.DM) #Discrete mathematics #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Mathematical analysis #Mathematics #Polynomial #Polynomial and algebraic computation #Pure mathematics #Reachability #cs.DM #math.DS
paper · pdf · doi:10.48550/arxiv.1201.0572
4 Pages, 2 Theorems, 4 Figures
arxiv created 2012/01/03 · openalex publication_date 2012/01/03 · arxiv updated 2012/01/04 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence. We use this to derive the infinite determinant that is zero, if and only if, the desired rational can be reached by some term in the recurrence. Second, we derive an infinite summation of rational Polynomials, such that this summation can be equal to 1, if and only if, the desired rational can be reached by some term in the recurrence.