Integrability and non-integrability of periodic non-autonomous Lyness recurrences (revised and enlarged version)

Abstract

This paper studies non-autonomous Lyness type recurrences of the form xn+2 = (an+xn+1)=xn, where fang is a k-periodic sequence of positive numbers with primitive period k. We show that for the cases k 2 f1; 2; 3; 6g the behavior of the sequence fxng is simple (integrable) while for the remaining cases satisfying this behavior can be much more complicated (chaotic). We also show that the cases where k is a multiple of 5 present some di erent features.