Skolem problem
A sequence follows a fixed linear recurrence. Is there an algorithm that always decides whether any term of the sequence equals zero?
Linear recurrences
Two different decisions about recurrence sequences: whether a zero occurs and whether all terms are nonnegative.
Subjects: Logic and computation · Analysis and dynamics
Problems in this collection
2 problemsPositivity problem for linear recurrences
Can an algorithm decide whether an integer sequence defined by a linear recurrence never becomes negative?