Constructing an expanding metric for dynamical systems in one complex variable

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…