On the Skolem Problem for Reversible Sequences

MaRDI QIDQ6393628zbMATH OpenFDO

Authors George Kenison

Publication date 14 March 2022

Abstract: Given an integer linear recurrence sequence $langle{X}_{n}angl{e}_n$, the Skolem Problem asks to determine whether there is a natural number $n$ such that $X_n=0$. Recent work by Lipton, Luca, Nieuwveld, Ouaknine, Purser, and Worrell proved that the Skolem Problem is decidable for a class of reversible sequences of order at most seven. Here we give an alternative proof of their result. Our novel approach employs a powerful result for Galois conjugates that lie on two concentric circles due to Dubickas and Smyth.

This page was built for publication: On the Skolem Problem for Reversible Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393628)