Abstract
We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a problem in dynamical systems raised by Cui.
Notes
1The code is maintained by the fourth-named author, and is available at https://github.com/jakobkroeker/HMAC.
2This is sometimes called Thurston equivalence.