Search

We consider nonlinear recurrences generated from cluster mutations applied to quivers that have the property of being cluster mutation-periodic with period 1. Such quivers were completely classified by Fordy and Marsh, who characterised them in terms of the skew-symmetric matrix that defines the quiver. The associated nonlinear recurrences are equivalent to birational maps, and we explain how these maps can be endowed with an invariant Poisson bracket and/or presymplectic structure. Upon applying the algebraic entropy test, we are led to a series of conjectures which imply that the entropy of the cluster maps can be determined from their tropical analogues, which leads to a sharp classification result. Only four special families of these maps should have zero entropy. These families are examined in detail, with many explicit examples given, and we show how they lead to discrete dynamics that is integrable in the Liouville-Arnold sense., Comment: 49 pages, 3 figures. Reduced to satisfy journal page restrictions. Sections 2.4, 4.5, 6.3, 7 and 8 removed. All other results remain, with minor editing

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential algebras. The algebraic treatment of boundary problems brings up two new algebraic structures whose symbolic representation and computational realization is based on canonical forms in certain commutative and noncommutative polynomial domains. The first of these, the ring of integro-differential operators, is used for both stating and solving linear boundary problems. The other structure, called integro-differential polynomials, is the key tool for describing extensions of integrodifferential algebras. We use the canonical simplifier for integro-differential polynomials for generating an automated proof establishing a canonical simplifier for integro-differential operators. Our approach is fully implemented in the THEOREMA system; some code fragments and sample computations are included.