Convergence of finite-root Julia sets to template Julia sets

Fix a parameter pair (c0,c1)C2(c_0,c_1)\in\mathbb{C}^2 and let s{\bf s} be a template. For each nn, let sn\overline{\bf s}^{n} denote the finite nn-root of s{\bf s}, and let Jc0,c1(sn)J_{c_0,c_1}(\overline{\bf s}^{n}) and Jc0,c1(s)J_{c_0,c_1}({\bf s}) be the associated Julia sets. Finite-root convergence conjecture. For every δ>0\delta>0, there exists NNN\in\mathbb{N} such that, for all nNn\geq N,

d(Jc0,c1(sn),Jc0,c1(s))<δ.d\bigl(J_{c_0,c_1}(\overline{\bf s}^{n}),J_{c_0,c_1}({\bf s})\bigr)<\delta.

The claim formalises convergence suggested by the numerical study of templates sharing longer initial segments. The source gives no evidence of a proof or disproof.

Sources & referencesView supporting material

Primary source

Anca Radulescu and Ariel Pignatelli, “Symbolic template iterations of complex quadratic maps”, arXiv:1503.05775 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.