Thurston equivalence to a rational map is decidable
classification
🧮 math.DS
math.GTmath.LO
keywords
decidablerationalthurstonalgorithmicallycoveringdemonstrateequivalenceequivalent
read the original abstract
We demonstrate that the question whether or not a given postcritically finite topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.