Abstract

We consider linear recursions of length two and related gap recursions where the indices may not be consecutive integers. Given a linear recursion of length two, we prove the existence of an explicit linear recursion of length l with arbitrary distance between indices. Conversely, it is shown under some mild assumption that a linear recursion of length l can be reduced to one of length two.

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