Dynamical dessins are dense
In this short note, the authors consider \[ {\mathcal G}=\{A \, \circ \, g \, \circ \, A^{-1} : A(z)=az+b, a, b \in \overline{\mathbb{Q}}, a\neq 0, g \in \mathrm{XDBP} \} \] where XDBP is the set of extra-clean dynamical Belyi polynomials [the second author, Ann. Sci. Éc. Norm. Supér. (4) 33, No. 5, 671--693 (2000; Zbl 1066.14503)]. The authors prove that given any continuum \(K\subset \mathbb{C}\) and any \(\epsilon >0\), there exists a polynomial \(g\in \mathcal{G}\) with \(d(J(g), K)<\epsilon\), where the Julia set satisfies \(J(g)=\partial K(g)\). This result is a generalized form of the result given by \textit{K. A. Lindsey} on Jordan curves [Ergodic Theory Dyn. Syst. 35, No. 6, 1913--1924 (2015; Zbl 1343.37028)] and it is obtained using an approximation result of the first author in [Invent. Math. 197, No. 2, 433--452 (2014; Zbl 1304.30028)]. Finally, some technical results are derived to construct the proof of the main result.
- Dessins d'enfants and Hubbard trees.
- Dynamics in One Complex Variable. (AM-160)
- scientific article; zbMATH DE number 732167 (Why is no real title available?)
- scientific article; zbMATH DE number 1460706 (Why is no real title available?)
- scientific article; zbMATH DE number 3427691 (Why is no real title available?)
- Shapes of polynomial Julia sets
- True trees are dense
- Julia sets of orthogonal polynomials
- On Lagrange polynomials and the rate of approximation of planar sets by polynomial Julia sets
- Shapes of polynomial Julia sets
- Attractor sets and Julia sets in low dimensions
- Fekete polynomials and shapes of Julia sets
- On dynamics of asymptotically minimal polynomials
- Interpolation of power mappings
- On the shapes of rational lemniscates
This page was built for publication: Dynamical dessins are dense
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888929)
