Near-Optimal Complexity Bounds for Fragments of the Skolem Problem

S. Akshay, Nikhil Balaji, Aniket Murhekar, Rohith Varma & Nikhil Vyas
Given a linear recurrence sequence (LRS), specified using the initial conditions and the recurrence relation, the Skolem problem asks if zero ever occurs in the infinite sequence generated by the LRS. Despite active research over last few decades, its decidability is known only for a few restricted subclasses, by either restricting the order of the LRS (upto 4) or by restricting the structure of the LRS (e.g., roots of its characteristic polynomial). In this paper,...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.