Thurston equivalence to a rational map is decidable
From MaRDI portal
Publication:5404570
zbMath1329.37046arXiv1009.5713MaRDI QIDQ5404570
Mark Braverman, Michael Yampolsky, Sylvain Bonnot
Publication date: 25 March 2014
Full work available at URL: https://arxiv.org/abs/1009.5713
Nonnumerical algorithms (68W05) Dynamical systems involving homeomorphisms and diffeomorphisms of planes and surfaces (37E30) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)
Related Items (8)
From rubber bands to rational maps: a research report ⋮ Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence ⋮ Origami, affine maps, and complex dynamics ⋮ Algorithmic aspects of branched coverings ⋮ Centralizers in mapping class groups and decidability of Thurston equivalence ⋮ Constructive geometrization of Thurston maps and decidability of Thurston equivalence ⋮ Rationality is decidable for nearly Euclidean Thurston maps ⋮ Recognizing topological polynomials by lifting trees
This page was built for publication: Thurston equivalence to a rational map is decidable
