Coding and tiling of Julia sets for subhyperbolic rational maps
| dc.creator | Kameyama, Atsushi | |
| dc.date | 2003-06-25 | |
| dc.date.accessioned | 2026-07-07T08:18:13Z | |
| dc.date.available | 2026-07-07T08:18:13Z | |
| dc.description | Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{π_r:Σ\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a certain tree to the Riemann sphere. Using the universal covering space $ϕ:\tilde S\to S$ for the corresponding orbifold, we lift the inverse of $f$ to an iterated function system $I=(g_i)_{i=1,2,...,d}$. For the purpose of studying the structure of $Cod(f)$, we generalize Kenyon and Lagarias-Wang's results : If the attractor $K$ of $I$ has positive measure, then $K$ tiles $ϕ^{-1}(J)$, and the multiplicity of $π_r$ is well-defined. Moreover, we see that the equivalence relation induced by $π_r$ is described by a finite directed graph, and give a necessary and sufficient condition for two coding maps $π_r$ and $π_{r'}$ to be equal. | |
| dc.description | 27 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/math/0306354 | |
| dc.identifier | http://arxiv.org/abs/math/0306354 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134357 | |
| dc.subject | Dynamical Systems | |
| dc.subject | Information Theory | |
| dc.subject | 37F20 (Primary); 28A80 (Secondary) | |
| dc.title | Coding and tiling of Julia sets for subhyperbolic rational maps | |
| dc.type | text |