Abstract
Properties of a family of quadratic maps of the real line are reviewed to illustrate the role of words on two letters in labeling the inverse graph of thenth iterate. Two problems in the abstract theory of words on two letters are described, the solutions of which are essential for the description of the inverse graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.L. Bivins, J.D. Louck, N. Metropolis, and M.L. Stein, Classification of all cycles of the parabolic map, Physics D51 (1991) 3–27.
R.L. Bivins, J.D. Louck, N. Metropolis, and M.L. Stein, Classification of all cycles of the parabolic map: The complete solution, in preparation.
K.M. Brucks, Dynamics of one-dimensional maps: Symbols, uniqueness, and dimension, Ph. D. Dissertation, North Texas State University Denton, Texas, USA, 1988.
P. Collet and J.-P. Eckmann, Iterated Maps on the Interval as Dynamical Systems, Birkhäuser, Boston, 1980.
B.-L. Hao, Chaos, World Scientific, Singapore, 1984.
M. Lothaire, Combinatorics on Words, Encyclopedia Math. Appl.17, G.-C. Rota, Ed., Addison-Wesley, Reading, 1981.
J.D. Louck, Conway numbers and iteration theory, Adv. Appl. Math.18 (1997) 181–215.
J.D. Louck and N. Metropolis, Symbolic Dynamics of Trapezoidal Maps, D. Reidel, Dordrecht, 1985.
N. Metropolis, M.L. Stein and P.R. Stein, On finite limit sets for transformations of the unit interval, J. Combin. Theory15 (1971) 24–45.
L. Sun and G. Helmberg, Maximal words connected with unimodal maps, Order4 (1988) 351–380.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Louck, J.D. Problems in combinatorics on words originating from discrete dynamical systems. Annals of Combinatorics 1, 99–104 (1997). https://doi.org/10.1007/BF02558466
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02558466