arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.00243math.DS
收藏

Levy and Thurston obstructions of finite subdivision rules

Insung Park

英文摘要:

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. In order to show the equivalence between Levy and Thurston obstructions, we generalize the arcs intersecting obstruction theorem by Pilgrim and Tan 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑