Coding and tiling of Julia sets for subhyperbolic rational maps

Abstract: Let

f : h a t C o h a t C

be a subhyperbolic rational map of degree

d

. We construct a set of coding maps

C o d (f) = {p i_{r} : S i g m a o 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

p h i : i l d e S o 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

C o d (f)

, we generalize Kenyon and Lagarias-Wang's results : If the attractor

K

of

I

has positive measure, then

K

tiles

p h i^{- 1} (J)

, and the multiplicity of

p i_{r}

is well-defined. Moreover, we see that the equivalence relation induced by

p i_{r}

is described by a finite directed graph, and give a necessary and sufficient condition for two coding maps

p i_{r}

and

p i_{r^{'}}

to be equal.

Recommendations

Cites Work

Cited In (1)

This page was built for publication: Coding and tiling of Julia sets for subhyperbolic rational maps