Name
Abstract | ||
|---|---|---|
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, we identify a subclass of LRS of arbitrary order for which the Skolem problem is easy, namely LRS all of whose characteristic roots are (possibly complex) roots of real algebraic numbers, i.e., roots satisfying x(d) = r for r real algebraic. We show that for this subclass, the Skolem problem can be solved in NPRP. As a byproduct, we implicitly obtain effective bounds on the zero set of the LRS for this subclass. While prior works in this area often exploit deep results from algebraic and transcendental number theory to get such effective results, our techniques are primarily algorithmic and use linear algebra and Galois theory. We also complement our upper bounds with a NP lower bound for the Skolem problem via a new direct reduction from 3-CNF-SAT, matching the best known lower bounds. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.4230/LIPIcs.STACS.2020.37 | Leibniz International Proceedings in Informatics |
Keywords | DocType | Volume |
Linear Recurrences,Skolem problem,NP-completeness,Weighted automata | Conference | 154 |
ISSN | Citations | PageRank |
1868-8969 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Akshay | 1 | 61 | 12.47 |
| Nikhil Balaji | 2 | 9 | 4.24 |
| Aniket Murhekar | 3 | 0 | 1.35 |
| Rohith Varma | 4 | 0 | 0.34 |
| Nikhil Vyas | 5 | 3 | 4.79 |