Abstract
Linear recurrence sequences permeate a vast number of areas of mathematics and computer science. In this paper, we survey the state of the art concerning certain fundamental decision problems for linear recurrence sequences, namely the Skolem Problem (does the sequence have a zero?), the Positivity Problem (is the sequence always positive?), and the Ultimate Positivity Problem (is the sequence ultimately always positive?). © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ouaknine, J., & Worrell, J. (2012). Decision problems for linear recurrence sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7550 LNCS, pp. 21–28). https://doi.org/10.1007/978-3-642-33512-9_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
