Given a linear recurrence sequence $\{a_n\}_{n\geq 0}$, how to decide whethere there are infinitely many zeros, or there are only finitely many ones?
zeros of linear recurence sequences
2
$\begingroup$
combinatorics
sequences-and-series
computer-science
-
0There is no way to answer such a vague question. What kind of recurrence relation do you have? – 2012-09-11
-
1If it's a linear homogeneous constant-coefficient recurrence, the Skolem-Mahler-Lech Theorem is helpful. See, e.g., http://cfranc.wordpress.com/2010/03/18/the-skolem-mahler-lech-theorem/ – 2012-09-11
-
0thanks. I mean given a linear recurrence relation, e.g., $a_{n+m}= \sum_{i=1}^{m-1} c_ia_{n+i}$, and $c_i$ are all integers, and $a_1, \dots, a_{m-1}$ are given integers. – 2012-09-11
-
0If you want to be sure I see your comment, you have to put @Gerry in there somewhere. Anyway, yes, that's a linear homogeneous constant-coefficient recurrence. I trust that by now you've had a look at Skolem-Mahler-Lech. Has it been helpful? – 2012-09-12