Displaying similar documents to “Irreducible complexity of iterated symmetric bimodal maps.”

⊗-product of Markov matrices.

J. P. Lampreia, A. Rica da Silva, J. Sousa Ramos (1988)

Stochastica

Similarity:

In this paper we introduce a ⊗-operation over Markov transition matrices, in the context of subshift of finite type, reproducing symbolic properties of the iterates of the critical point on a one-parameter family of unimodal maps. To the *-product between kneading sequences we associate a ⊗-product between the corresponding Markov matrices.

On the ∗-product in kneading theory

Karen Brucks, R. Galeeva, P. Mumbrú, D. Rockmore, Charles Tresser (1997)

Fundamenta Mathematicae

Similarity:

We discuss a generalization of the *-product in kneading theory to maps with an arbitrary finite number of turning points. This is based on an investigation of the factorization of permutations into products of permutations with some special properties relevant for dynamics on the unit interval.

A characterization of the kneading pair for bimodal degree one circle maps

Lluis Alsedà, Antonio Falcó (1997)

Annales de l'institut Fourier

Similarity:

For continuous maps on the interval with finitely many monotonicity intervals, the kneading theory developed by Milnor and Thurston gives a symbolic description of the dynamics of a given map. This description is given in terms of the kneading invariants which essentially consists in the symbolic orbits of the turning points of the map under consideration. Moreover, this theory also describes a classification of all such maps through theses invariants. For continuous bimodal degree one...