# On the Skolem Problem for Reversible Sequences

George Kenison

Given an integer linear recurrence sequence ⟨Xn⟩n, the Skolem Problem asks to determine whether there is a natural number n such that Xn=0. In a recent preprint, Lipton, Luca, Nieuwveld, Ouaknine, Purser, and Worrell prove that the Skolem Problem is decidable for a class of reversible sequences of order at most seven. Herein, we give an alternative proof of the result. The novelty of our approach arises from our use of results concerning the polynomial relations between Galois conjugates.