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.
Preprint. Versió revisada i augmentada d'un anterior report homònim.
CitationCima, A.; Gasull, A.; Mañosa, V. "Integrability and non-integrability of periodic non-autonomous Lyness recurrences (revised and enlarged version)". 2011.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org