Thurston's algorithm without critical finiteness
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
Shared notation.
$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.Identify $S^2$ with the Riemann sphere and choose three distinct base points. Starting from an orientation-preserving branched covering $f_0:S^2\to S^2$, let $h_j$ be the homeomorphism fixing those points that makes $r_j=f_j\circ h_j$ holomorphic, and put $f_{j+1}=h_j^{-1}\circ f_j\circ h_j$. Define $\phi_j=(h_0\circ\cdots\circ h_j)^{-1}$. A branched covering is locally a finite-degree covering except at finitely many branch points. No finiteness of the forward critical orbits is assumed. Uniform convergence on the sphere uses the spherical metric. There is also an interval version. Let $I=[0,1]$ and let $f_0:I\to I$ be piecewise monotone with $d$ alternately increasing and decreasing monotonicity intervals, sending its endpoints to endpoints. At each step choose the orientation-preserving homeomorphism $h_j$ for which $p_j=f_j\circ h_j$ is a polynomial of degree $d$, and again set $f_{j+1}=h_j^{-1}\circ f_j\circ h_j$.
Statement recorded in the supplied source.
Under what conditions do the rational maps $r_j$ converge uniformly to a rational map $r_\infty$? Under what conditions, and on what subset of $S^2$, do the coordinate maps $\phi_j$ converge uniformly? For the interval construction, likewise decide when and where the procedure converges. [S2]Short English statement
Determine conditions for convergence of the rational maps and coordinate changes produced by Thurston’s algorithm without assuming finite critical orbits, and determine convergence in its interval analogue.Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 5300020 (AMR-052-0020). CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 John Milnor, Thurston’s algorithm without critical finiteness, in Ben Bielefeld and Mikhail Lyubich (editors), Problems in holomorphic dynamics (1992). Construction, displayed Problem, and Maps of the interval, pp. 12–13. https://arxiv.org/pdf/math/9205209.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.