Algorithmic construction of Hurwitz maps
arXiv:1303.1579 · doi:10.1080/10586458.2013.860569
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.
23 pages, three colour figures; to appear in Exp. Math