Defining the complexity of a green pattern exhibited by an interval map, we give the best bounds of the topological entropy of a pattern with a given complexity. Moreover, we show that the topological entropy attains its strict minimum on the set of patterns with fixed eccentricity m/n at a unimodal X-minimal case. Using a different method, the last result was independently proved in[11].
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We study the law of coexistence of different types of cycles for a continuous map of the interval. For this we introduce the notion of eccentricity of a pattern and characterize those patterns with a given eccentricity that are simplest from the point of view of the forcing relation. We call these patterns X-minimal. We obtain a generalization of Sharkovskiĭ's Theorem where the notion of period is replaced by the notion of eccentricity.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.