Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T21:21:27.077Z Has data issue: false hasContentIssue false

Levy and Thurston obstructions of finite subdivision rules

Published online by Cambridge University Press:  15 December 2023

INSUNG PARK*
Affiliation:
Department of Mathematics, Indiana University, Bloomington, IN 47405, USA
*
Rights & Permissions [Opens in a new window]

Abstract

For a post-critically finite branched covering of the sphere that is a subdivision map of a finite subdivision rule, we define non-expanding spines which determine the existence of a Levy cycle in a non-exhaustive semi-decidable algorithm. Especially when a finite subdivision rule has polynomial growth of edge subdivisions, the algorithm terminates very quickly, and the existence of a Levy cycle is equivalent to the existence of a Thurston obstruction. To show the equivalence between Levy and Thurston obstructions, we generalize the arcs intersecting obstruction theorem by Pilgrim and Tan [Combining rational maps and controlling obstructions. Ergod. Th. & Dynam. Sys. 18(1) (1998), 221–245] to a graph intersecting obstruction theorem. As a corollary, we prove that for a pair of post-critically finite polynomials, if at least one polynomial has core entropy zero, then their mating has a Levy cycle if and only if the mating has a Thurston obstruction.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2023. Published by Cambridge University Press
Figure 0

Figure 1A finite subdivision rule of $z\mapsto ({z^2-1})/({z^2+1})$. The sphere is decomposed into two triangles in $S_{\mathcal {R}}$. Each triangle subdivides into two triangles under the subdivision $\mathcal {R}$. The subdivision map $f:\mathcal {R}(S_{\mathcal {R}})\to S_{\mathcal {R}}$ sends each shaded or unshaded triangle in $\mathcal {R}(S_{\mathcal {R}})$ to the shaded or unshaded triangle in $S_{\mathcal {R}}$, respectively.

Figure 1

Figure 2Bones of bands. The figure on the right shows the case when two sides of the band are the same.

Figure 2

Figure 3The bold edge is an edge of $\mathcal {T}$ and the dotted edge is an edge of $\mathcal {T}'$ that is not an edge of $\mathcal {T}$.

Figure 3

Figure 4A graph with polynomial growth rate of $P(v,n)$. Any arrow indicates paths, any dotted arrow means it may not exist but if exists it indicates a path, and any circle indicates a cycle. In each cycle, the incoming vertex and the outgoing vertex could be the same.

Figure 4

Figure 5An example of expanding finite subdivision rule which is neither edge separating nor vertex separating.

Figure 5

Figure 6The left figure is $g_k$ drawn in $S_{\mathcal {R}}$, and the right figure is $h_{k,n_i}$ drawn in $\mathcal {R}^{n_i}(S_{\mathcal {R}})$. The bold line segments are portions of $1$-skeletons of $S_{\mathcal {R}}$ and $\mathcal {R}^{n_i}(S_{\mathcal {R}})$.

Figure 6

Figure 7Train-track structures on non-expanding spines.

Figure 7

Figure 8Transformation from a graph to a train-track. The dots on the boundary are vertices of a polygon. The graph contains two complete graphs with more than three vertices. These graphs are transformed into star-like trees of degree $4$ and $5$, respectively. We ‘zip-up’ at boundary points to define a train-track structure.

Figure 8

Figure 9An example of level-$0,1$ non-expanding spines, which are non-essential.

Figure 9

Figure 10Blowing-up arcs of graphs.

Figure 10

Figure 11Finite subdivision rules defined from the face-inversion of a planar graph.

Figure 11

Figure 12Julia set of $z\mapsto -{1.50351z^2(z^2-1.15757z-0.596204)}/{z+0.133305}$.

Figure 12

Figure 13A degree $6$ finite subdivision rule with six tile types.

Figure 13

Figure 14A finite subdivision rule with $\unicode{x3bb}>\nu $.