We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
was introduced in 1947 by Lyness [1] and it, and related equations, have long been studied; see [1, 2, 3, 4, 5, 6, 7] and references therein. Perhaps surprisingly, all solutions of (1) are bounded (i.e. for all x1, x2, the set {xn} is bounded) - we will show that below. Furhter, there often exist periodic solutions (i.e. xn = xn+N for all n in which case we say that (xn) has period N). See [8] for a discussion of which periods are possible for a given α. We note that a sequence of period, say, 5 also has periods 10, 15, 20, …. so we use the term minimal period for the smallest positive N such that xn = xn+N for all n.
Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
Gasull, A., Mañosa, V., Xarles, X., Rational periodic sequence for the Lyness recurrence, Cornell University (2012) available at arXiv.org.abs/1004.5511Google Scholar
Kocic, V. and Ladas, G., Global behavior of nonlinear difference equations of higher order with applications, Kluwer Academic Publishers, Norwell, MA (1993).CrossRefGoogle Scholar
6
Northshield, S., A Lyness equation for graphs, J. Difference Equ. Appl., 18(7) (2012) pp. 1183–1191.CrossRefGoogle Scholar
7
Zeeman, C., Geometric unfolding of a difference equation, (notes of a talk given May 19, 1997 at Cambridge Univ.), accessed March 2019 at zakuski.utsa.edu/˜gokhman/ecz/geometric unfolding.pdfGoogle Scholar
8
Bastien, G. and Rogalski, M., Global behavior of the solutions of Lyness' difference equation un+2un = un+1 + a, J. Difference Equ. Appl.10(11) (2004) pp. 997–1003.CrossRefGoogle Scholar
9
Barbeau, E., Gelbord, B., and Tanny, S., Periodicities of solutions of the generalized Lyness recursion, J. Difference Equ. Appl.1(3) (1995) pp. 291–306.CrossRefGoogle Scholar