Abstract

Let A h be a sequence of rational numbers, satisfying a linear recurrence with polynomial coefficients. Recently, Van der Poorten and Shparlinski have given an effective procedure to check if such a sequence is periodic, which relies on an upper and on a lower bound on A h . In this paper, we improve these bounds, and we give another procedure to test the periodicity of the sequence.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call