Algebraic entropy

From MaRDI portal



Abstract: For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the irreversibility of the map. We indicate how it can be exactly calculated.


The paper deals with maps on real projective spaces that are defined by homogeneous rational mappings in each coordinate. Each coordinate map has the same degree, and by working in projective space one can discard any common factors of the coordinate maps. The algebraic entropy of such a map, \(f\), is the exponential growth rate of the sequence of reduced degrees of the iterates \(f^{n}\) of \(f\), where the reduced degree is the degree after any common factors have been discarded. A framework for calculating algebraic entropy is presented, and illustrated by application to a number of examples.




Cited in
(only showing first 100 items - show all)








This page was built for publication: Algebraic entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809265)