Abstract
An algorithm is presented for computing the topological entropy of a piecewise monotone map of the interval having three monotone pieces. The accuracy of the algorithm is discussed and some graphs of the topological entropy obtained using the algorithm are displayed. Some of the ideas behind the algorithm have application to piecewise monotone functions with more than three monotone pieces.
Similar content being viewed by others
References
S. Baldwin, A complete classification of the piecewise monotone functions on the interval,Trans. Am. Math. Soc. 319:155–178 (1990).
L. Block, J. Keesling, S. Li, and K. Peterson, An improved algorithm for computing topological entropy,J. Stat. Phys. 55:929–939 (1989).
R. Bowen, Entropy for group endomorphisms and homogeneous spaces,Trans. Am. Math. Soc. 153:401–413 (1971).
P. Collet, J. P. Crutchfield, and J.-P. Eckmann, Computing the topological entropy of maps,Commun. Math. Phys. 88:257–262 (1983).
P. Collet and J.-P. Eckmann,Iterated Maps of the Interval as Dynamical Systems (Birkhäuser, Boston, 1980).
P. Góra and A. Boyarsky, Computing the topological entropy of general one-dimensional maps,Trans. Am. Math. Soc., to appear.
M. Misiurewicz and W. Szlenk, Entropy of piecewise monotone mappings,Studia Math. 67:45–63 (1980).
J. Milnor and W. Thurston, On iterated maps of the interval, inLecture Notes in Mathematics, No. 1342 (1988), pp. 465–563.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Block, L., Keesling, J. Computing the topological entropy of maps of the interval with three monotone pieces. J Stat Phys 66, 755–774 (1992). https://doi.org/10.1007/BF01055699
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01055699