Thurston's algorithm and rational maps from quadratic polynomial matings

From MaRDI portal
Publication:2305705

DOI10.3934/DCDSS.2019151zbMATH Open1439.37048arXiv1705.01184OpenAlexW2963589567MaRDI QIDQ2305705FDOQ2305705


Authors: Mary Wilkerson Edit this on Wikidata


Publication date: 13 March 2020

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Abstract: Topological mating is an 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 z2+c that are postcritically finite, there is a fast test on the constant parameters to determine whether this map F exists---but this test is not constructive. 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 cite{MEDUSA}. 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.


Full work available at URL: https://arxiv.org/abs/1705.01184




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Thurston's algorithm and rational maps from quadratic polynomial matings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305705)