Constructing an expanding metric for dynamical systems in one complex variable
Suzanne Lynch Hruska
Abstract
We describe a rigorous computer algorithm for attempting to construct an explicit, discretized metric for which a complex polynomial map is expansive on a given neighborhood of its Julia set. We show construction of such a metric proves the map is hyperbolic. We also examine the question of whether the algorithm can be improved, and the related question of how to build a metric as close to euclidean as possible. Finally, we give several examples generated with our implementation of this algorithm.
Create a lesson
Related papers
Adjoint-Based Stochastic Analysis for Fatigue of Aeroelastic and Frictional Systems
Justin H. Porter
Asymptotic Analysis of Discrete-Time Self-Attention Dynamics in Transformers
Claudio Altafini
Dimension theory of group actions by circle diffeomorphisms I: Stationary measures
Weikun He, Yuxiang Jiao, Disheng Xu
Hausdorff Dimension and Flexibility for Attractors of Non-Uniformly Hyperbolic Flows
Elias Rego, Paulo Varandas
Finiteness of planar central configurations of five bodies for all positive masses
Tejasvi Singh Tomar
Khintchine dichotomy for images of self-similar measures and almost random walks
Liyang Shao