2012
DOI: 10.17323/1609-4514-2012-12-4-747-763
|View full text |Cite
|
Sign up to set email alerts
|

Thurston Equivalence to a Rational Map is Decidable

Abstract: We demonstrate that the question whether or not a given topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
27
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 15 publications
(28 citation statements)
references
References 9 publications
1
27
0
Order By: Relevance
“…So HS contains either (0, 1) or (2, 1). One verifies that [ 1 2 0 1 ] ∈ SL(2, Z) induces an automorphism on Z 4 ⊕ Z 2 which fixes (0, 0), ±(1, 0), ±(1, 1) and interchanges (0, 1) and (2,1). Hence there is only one equivalence class of these Hurwitz structure sets and only one impure Hurwitz class of such maps.…”
Section: Invariants Of Degree 2 Net Mapsmentioning
confidence: 83%
See 2 more Smart Citations
“…So HS contains either (0, 1) or (2, 1). One verifies that [ 1 2 0 1 ] ∈ SL(2, Z) induces an automorphism on Z 4 ⊕ Z 2 which fixes (0, 0), ±(1, 0), ±(1, 1) and interchanges (0, 1) and (2,1). Hence there is only one equivalence class of these Hurwitz structure sets and only one impure Hurwitz class of such maps.…”
Section: Invariants Of Degree 2 Net Mapsmentioning
confidence: 83%
“…The static portrait is the bipartite directed graph whose vertex set is the disjoint union of A := C(f ) ∪ P (f ) and B := P (f ), directed edges → q 2 , p 3 → q 3 , p 4 → q 4 ), and the branch data is ( [2], [2], [1,1], [1,1]). The static portrait, and hence branch data, are impure Hurwitz invariants.…”
Section: Invariants Of Degree 2 Net Mapsmentioning
confidence: 99%
See 1 more Smart Citation
“…In [4] it was shown that, outside of some exceptional cases, the question of Thurston equivalence to a rational mapping is algorithmically decidable. Namely, there exists an algorithm A 1 which, given a combinatorial description of f , outputs 1 if f is equivalent to a rational mapping and 0 otherwise.…”
Section: Introductionmentioning
confidence: 99%
“…It has a portrait B˚: A ý induced by the map on peripheral conjugacy classes, and a local degree deg a pBq. There is a minimal orbisphere quotient of G associated with B, which is the quotient G of G by the additional relations Γ ord B paq a " 1, for (11) ord B paq " l. c. m.td | n ě 0 and Γ a has a lift of degree d under B bn u,…”
Section: It Admits As a Subbiset Thementioning
confidence: 99%