Bilu, Y, Luca, F, Nieuwveld, J, Ouaknine, J, Purser, D and Worrell, J
(2022)
Skolem Meets Schanuel.
In: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022).
|
PDF
mfcs22.pdf - Author Accepted Manuscript Download (700kB) | Preview |
Abstract
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem, asks to determine whether a given linear recurrence sequence has a zero term. Although the Skolem-Mahler-Lech Theorem is almost 90 years old, decidability of the Skolem Problem remains open. The main contribution of this paper is an algorithm to solve the Skolem Problem for simple linear recurrence sequences (those with simple characteristic roots). Whenever the algorithm terminates, it produces a stand-alone certificate that its output is correct - a set of zeros together with a collection of witnesses that no further zeros exist. We give a proof that the algorithm always terminates assuming two classical number-theoretic conjectures: the Skolem Conjecture (also known as the Exponential Local-Global Principle) and the p-adic Schanuel Conjecture. Preliminary experiments with an implementation of this algorithm within the tool Skolem point to the practical applicability of this method.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 29 Mar 2023 10:11 |
| Last Modified: | 04 Jul 2024 21:41 |
| DOI: | 10.4230/LIPIcs.MFCS.2022.20 |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3169331 |
Altmetric
Altmetric
