Thurston's algorithm and rational maps from quadratic polynomial matings
Mary Wilkerson · Discrete and Continuous Dynamical Systems - S · 2019
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Discrete and Continuous Dynamical Systems - S · American Institute of Mathematical Sciences · article · 2019
Abstract
Topological mating is a combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $ F $ on the Riemann sphere. Given a pair of polynomials of the form $ z^2+c $ that are postcritically finite, there is a fast test on the constant parameters to determine whether this map $ F $ exists-but this test does not give a construction of $ F $. We present an iterative method that utilizes finite subdivision rules and Thurston's algorithm to approximate this rational map, $ F $. This manuscript expands upon results given by the Medusa algorithm in [9].
We provide a proof of the algorithm's efficacy, details on its implementation, the settings in which it is most successful, and examples generated with the algorithm.
Open the resolved locator · 10.3934/dcdss.2019151
Metadata licence: OpenAlex metadata (CC0)