ABSTRACT

In this chapter we discuss a special yet sizable class of recursive difference equations of type

xn+1 = fn(xn, xn−1, . . . , xn−k) (4.1)

that possess semiconjugate factorizations on groups. This class of equations is distinguished by the fact that the defining functions fn can be identified by a simple algebraic rule.