Given an unknown attractor 𝓐 in a continuous dynamical system, how can we discover the topology and dynamics of 𝓐? As a practical matter, how can we do so from only a finite amount of information? One way of doing so is to produce a semi-conjugacy from 𝓐 onto a model system 𝓜 whose topology and dynamics are known. The complexity of 𝓜 then provides a lower bound for the complexity of 𝓐. The Conley index can be used to construct a simplicial model and a surjective semi-conjugacy for a large class of attractors. The essential features of this construction are that the model 𝓜 can be explicitly described; and that the finite amount of information needed to construct it is computable.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper is an introduction to connection and transition matrices in the Conley index theory for flows. Basic definitions and simple examples are discussed.
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ć.