Algorithmic construction of Hurwitz maps
classification
🧮 math.AT
math.DSmath.GR
keywords
algorithmalgorithmicapproximationarbitrarilybeencomplexconstructionconstructs
read the original 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.
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.