Recognizing topological polynomials by lifting trees

2019/06/18 by Belk, James, Lanier, Justin, Margalit, Dan +1 · 1 citation
#Dynamical Systems (math.DS) #FOS: Mathematics #Geometric Topology (math.GT)

paper · doi:10.48550/arxiv.1906.07680

Abstract

We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the canonical obstruction. Our approach is rooted in geometric group theory, using iteration on a simplicial complex of trees, and building on work of Nekrashevych. As one application of our methods, we resolve the polynomial case of Pilgrim's finite global attractor conjecture. We also give a new solution to Hubbard's twisted rabbit problem, and we state and solve several generalizations of Hubbard's problem where the number of post-critical points is arbitrarily large.

Cited by

• On the Global Curve Attractor for polynomial gluing

Related

• On postcritically finite polynomials, part 2: Hubbard trees
• Combinatorial Hubbard trees for postcritically infinite unicritical polynomials and exponential maps
• Hubbard forests
• Homotopy Hubbard Trees for post-singularly finite exponential maps
• Generalized Pseudo-Anosov Maps and Hubbard Trees