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
A lamination is a continuum which locally is the product of a Cantor set and an arc. We investigate the topological structure and embedding properties of laminations. We prove that a nondegenerate lamination cannot be tree-like and that a planar lamination has at least four complementary domains. Furthermore, a lamination in the plane can be obtained by a lakes of Wada construction.
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ć.