Thurston's algorithm without critical finiteness
Statement
Starting with an orientation-preserving branched covering and three marked base points, iteratively conjugate it as in Thurston's pullback algorithm to obtain rational maps and coordinate maps . Under what conditions does converge uniformly to a rational map , and under what conditions and on what subset of does converge uniformly?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.