arXiv · 1303.1579
Algorithmic construction of Hurwitz maps
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.
Explore related subjects
Keep this discovery
Laurent Bartholdi, Xavier Buff, Hans-Christian Graf von Bothmer, Jakob Kröker. 2013-10-27. Algorithmic construction of Hurwitz maps. https://doi.org/10.1080/10586458.2013.860569
Cite the original work for its findings. Save a collection to share your selection of sources.