|Date:||Mon, February 10, 2014|
|Place:||Research II Lecture Hall|
Abstract: We will prove a new rigidity theorem for expanding dynamical systems, and use it to describe a method of constructing a recurrent procedure producing approximations of expanding dynamical systems and their Julia sets by simplicial complexes. These recurrent procedures are generalizations of Hubbard trees, subdivision rules, and automata. They can be applied to dynamical systems in any dimension, and can be used to describe Julia sets that can not be visualized by other means. Some examples from dynamics of several complex variables will be presented.