Rationality is decidable for nearly Euclidean Thurston maps
William Floyd, Walter Parry, Kevin M. Pilgrim

TL;DR
This paper proves that the problem of deciding whether a nearly Euclidean Thurston map is equivalent to a rational function is decidable, providing bounds that explain the effectiveness of computational tools like NETmap.
Contribution
It establishes bounds on the size of the finite computation needed to determine rationality of NET maps, linking geometric size to algorithmic decidability.
Findings
Decidability of rationality for NET maps is established.
Bounds are provided for the computational complexity based on diagram size.
The results explain the practical success of the NETmap software.
Abstract
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound , there are finitely many diagrams of size at most . Given a NET map presented by a diagram of size at most , the problem of determining whether is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality.
| 2 | 5 | 8 | 11 | 14 | 17 | 20 | 23 | 26 | 29 | |
|---|---|---|---|---|---|---|---|---|---|---|
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Rationality is decidable for Nearly Euclidean Thurston maps
William Floyd
Department of Mathematics
Virginia Tech
Blacksburg, VA 24061
USA
[email protected] http://www.math.vt.edu/people/floyd ,
Walter Parry
Department of Mathematics and Statistics
Eastern Michigan University
Ypsilanti, MI 48197
USA
and
Kevin M. Pilgrim
Department of Mathematics, Indiana University, Bloomington, IN 47405, USA
Abstract.
Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound , there are finitely many diagrams of size at most . Given a NET map presented by a diagram of size at most , the problem of determining whether is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality.
Key words and phrases:
Thurston map, decidable
2010 Mathematics Subject Classification:
Primary: 37F10; Secondary: 57M12
Contents
- 1 Introduction
- 2 Notation
- 3 Deriving the height bound
- 4 The slope function is surjective or trivial
- 5 How size controls geometry
- 6 Fixed cusps have short continued fraction expansions
- 7 Quantitative excluded intervals
- 8 A sequence of NET maps with large obstruction slope heights
1. Introduction
A Thurston map is an orientation-preserving branched covering of degree at least two for which the postcritical set is finite; here denotes the set of branch points of . Thurston maps originally arose in fundamental classification problems in one-complex-dimensional dynamics [8]. If a finite set is given, the collection of isotopy classes relative to of Thurston maps with and forms a countable semigroup under composition. The collection of all isotopy classes of Thurston maps obtained by pre- and post-composing a given Thurston map with orientation-preserving homeomorphisms fixing –called its pure modular group Hurwitz class–has a very rich algebraic structure; see [2]. Through this more recent algebraic perspective, Thurston maps may now be fruitfully regarded as analogs of elements of the well-studied mapping class groups. For example, a finite collection of pairwise disjoint, mutually non-homotopic curves on a surface that is left invariant by a mapping class–a so-called reducing multicurve–is typically regarded as an obstruction to geometrization of this class. Moreover, among such reducing multicurves, there exists a canonical one [9, Cor. 13.3]. Here, geometrization means finding a representative of the class with optimal geometric properties–a periodic or pseudo-Anosov map. On the Thurston map side, W. Thurston’s fundamental characterization and rigidity theorem says the following. Typically, in the absence of an obstruction–again defined as a multicurve with certain invariance properties–a Thurston map is conjugate-up-to-isotopy, or equivalent, to a rational function, unique up to Möbius transformations. Again, among all such obstructions, there exists a canonical one [19], [20].
The current state of algorithms for computing with mapping class groups is quite advanced. For example, Margalit, Strenner, and Yurttaş [15] have announced a quadratic-time algorithm for locating reducing curves (and more). That is, given a concrete presentation of a mapping class in terms of a standard generating set, their algorithm (and implementation, Macaw, available at https://github.com/b5strbal/macaw) locates in quadratic time a certain canonically defined reducing curve, if it exists.
Our main result here is an incremental, but first, such quantitative result for Thurston maps. It is incremental because (i) it is restricted to a special class of Thurston maps, called nearly Euclidean Thurston (NET) maps, that we have been studying in [7, 10, 11, 12, 18], and (ii) our bounds are unfortunately not quite explicit, due to our inability to effectively estimate a certain geometric constant; see Section 6 below. Our methods, however, employ geometric themes also encountered in the study of mapping class groups. In particular, continued fractions play an essential role in our study.
A Thurston map is a NET map if and every branch point is simple, i.e has local degree . Among NET maps are the atypical Euclidean Thurston maps, which are equivalent to quotients of affine planar maps, and the question of their rationality is equivalent to an easy-to-verify condition on the eigenvalues of the derivative of this affine endomorphism. Our sole focus here is on the more typical, non-Euclidean NET maps. A NET map is non-Euclidean, or typical, if and only if some element of is critical.
Each NET map, up to equivalence, is describable by a simple NET map presentation diagram ; see [11]. Figure 1 shows a presentation diagram for the Douady rabbit polynomial.
Each presentation diagram shows a parallelogram spanned by two linearly independent integer lattice vectors . In Figure 1, and . The geometric size of a NET map presentation diagram is defined as . A NET map presentation diagram determines a unique isotopy class of NET maps . Here is how; see [11, Lemma 3.1(3)] for details. Let denote the quotient map to the standard square pillowcase, where . The set is the image of under the natural projection. Let be the integer vector whose coordinates are circled in the diagram. Let be the affine map where is the corresponding column matrix. Let be the induced affine endomorphism; it is a Euclidean NET map. Finally, let , where is a homeomorphism obtained by pushing the starting points along the images of in the direction indicated by the dashed green arcs in Figure 1. The resulting map is a Thurston map with . (We remark that in the notation of [11, Lemma 3.1(3)], the map where and .) The map is a typical non-Euclidean NET map if and only if there is at least one nontrivial dashed green arc and , so that ; these conditions are easy to check. The degree of is the determinant .
In this work, we always assume by conjugation that all NET maps are defined on the standard square pillowcase and have postcritical set as defined in the previous paragraph.
On , each isotopy class of simple closed essential nonperipheral unoriented curves contains a representative which lifts to a Euclidean geodesic of rational slope. In this way we obtain a bijection between such classes of curves and the set of their slopes, the set of extended rational numbers, . Given a NET map and a simple closed curve in with slope , we let denote the number of essential nonperipheral connected components of and we let denote the (necessarily common) degree with which these connected components map to [7, Section 5]. The multiplier of is . We let stand for the union of isotopy classes of peripheral and inessential curves. Via pullback, a NET map induces a slope function . It also induces similarly an analytic self-map , where the upper half-plane is naturally identified, via the Weierstrass theory, with the Teichmüller space of [8]. Selinger [20] shows that extends canonically to the Weil-Petersson completion of , which adjoins the set of cusps. If are slopes, then , where and are the corresponding cusps. We define the height of for integers , with as .
An obstructed non-Euclidean NET map necessarily has a unique obstruction, i.e. there is a single extended rational obstruction slope. It is a fixed point of . So we are interested in fixed points of . Since fixed points of are negative reciprocals of fixed points of , we are also interested in cusps fixed by . Most of our work involves making estimates about .
An elementary argument shows there are at most presentation diagrams with . Thus there is an upper bound for the height of the slope of an obstruction of an obstructed NET map with . Less obviously, there is usually also an upper bound for the height of every fixed point of . Our main result gives an estimate for .
Theorem 1.1** (Height bound for fixed cusps).**
Let be a non-Euclidean NET map presentation diagram with , and the corresponding NET map. Then there exists a positive integer with the following properties.
- (1)
Let be a cusp fixed by , and assume that is the negative reciprocal of the unique obstruction slope if has an obstruction with multiplier 1. Then
[TABLE]
The exponent is an upper bound on the length of the continued fraction expansion of a cusp fixed by , and satisfies where . The implied constant and the real number are universal. The constant depends only on the modular group Hurwitz class of and is defined as an upper bound on the size of the Teichmüller (hyperbolic) derivative of on a universal cocompact subset of Teichmüller space, independent of . 2. (2)
The function cannot be taken to be a polynomial in even if we restrict attention to only negative reciprocals of slopes of obstructions.
By testing for obstructions all curves of slopes up to height , we obtain a very special case of the more general but non-quantitative result of Bonnot, Braverman, and Yampolsky [5]; see also [3]:
Corollary 1.2** (Rationality is decidable for NET maps).**
Suppose . The question, “Is equivalent to a rational map?” is decidable.
Before discussing the proof, we make some remarks about the last, sharpness assertion (2) in Theorem 1.1.
- (1)
There is a competing natural notion of size for a NET map presentation diagram. Following Bartholdi-Nekrashevych [4], one can rather naturally associate, using the geometry of the presentation diagram, a wreath recursion on the fundamental group of induced by . As basepoint for , one may take e.g. . Since is presented as , there is a natural generating set for satisfying : the ’s run from the basepoint to a corner of the front square of the pillowcase, and then loop around the corner point. By definition, the wreath recursion is a certain homomorphism , , given by where . The definition of depends on a choice of a collection of homotopy classes of arcs joining the basepoint to each of its preimages. The diagram gives a natural way to do this. Define the algebraic size of as . It is not difficult to show that . However, there is no similar bound in the other direction: if , is very large, and there is just one nontrivial green arc joining to e.g. , then the algebraic size will be small while the geometric size will be large. 2. (2)
Two different presentation diagrams may yield isotopic–not just equivalent–Thurston maps. The natural action of on presentation diagrams–by just applying the matrix to the whole diagram–corresponds to post-composition with the induced map on the quotient pillowcase. On the level of isotopy classes, however, this action is not free: for any typical Thurston map, there are always nontrivial mapping classes containing representatives which lift under to homeomorphisms isotopic to the identity [13, Theorem 6.3]. 3. (3)
The previous remark implies that a given NET map is isotopic relative to to infinitely many maps , so that as . Section 8 below, however, shows the sharpness statement (2) of Theorem 1.1 by exhibiting an infinite sequence of degree 2 Thurston maps with and obstruction slope satisfying . In particular, . Since the obstructions are unique and their slope heights tend to infinity, the maps define an infinite set of distinct homotopy classes. Nonetheless, we prove in Theorem 8.3 that these maps lie in only three equivalence classes.
There are two main ingredients in the proof of Theorem 1.1. The first ingredient, Theorem 1.3, bounds the length of the continued fraction expansion of a cusp fixed by in terms of the size bound and an estimate for the hyperbolic derivative on a certain universal cocompact subset of . We are unfortunately unable to bound explicitly away from in terms of .
The second ingredient, Theorem 1.4, exploits a key feature of NET maps: given a slope , there is an algorithm for calculating the image (under pullback) slope , as well as the number of essential preimage components of a curve with slope and the (necessarily common) degree by which they map under [7, Section 5]. A slope fixed by is the slope of an obstruction if and only if the multiplier, , satisfies . In terms of cusps, a cusp corresponds to an obstruction if and only if for each horoball tangent to . Similarly, a cusp is fixed if and only if for each horoball tangent to , the image is contained in another horoball tangent to which cannot be much larger than . By exploiting this observation, one can show that each datum gives rise to an excluded interval in which fixed cusps cannot lie [18]. Theorem 1.4 extends the Half-Space Theorem of [7, Theorem 6.7] in two ways: it excludes fixed cusps, not just negative reciprocals of slopes of obstructions, and it applies in wider generality to certain exceptional cases not treated there. Related excluded intervals are used in the computer program NETmap in its attempt to answer the question of whether a given map is equivalent to a rational map. Under robust observed conditions, the program succeeds: on every example in the database of 40,000+ examples tabulated at the website [17], the rationality question is answered, modulo our faith in numerical precision. The height bound in Theorem 1.1 partially explains this observed effectiveness.
Here are the precise statements of these two ingredients. In each, we denote by where and is non-Euclidean. We let denote the regular continued fraction with partial quotients .
Theorem 1.3** (Fixed cusps have short continued fraction expansions).**
There exists a positive integer such that if is a cusp for which , then
[TABLE]
and . The constant depends only on the modular group Hurwitz class of and is an upper bound on the size of the Teichmüller (hyperbolic) derivative of on a universal cocompact subset of Teichmüller space, independent of . The implicit constant is universal.
Theorem 1.4** (Quantitative excuded intervals).**
There exist positive numbers and for every positive integer with the following property. Let be a cusp with . Assume that if then the multiplier . Then
- (1)
if , the deleted-at-infinity interval contains no cusps fixed by ; 2. (2)
if , the deleted interval contains no cusps fixed by .
Furthermore and .
The assumption that the multiplier of a fixed cusp satisfies is necessary. Here is an example. Figure 2 shows a presentation diagram for a NET map . The map has an obstruction with slope and multiplier 1. The curve of slope [math] is fixed. Let be a Dehn twist about . It is easy to check directly that is isotopic to relative to . Since we may choose so that , it follows that for each even integer . Thus every deleted interval about the fixed cusp [math] contains infinitely many fixed cusps.
Organization. Section 3 derives the height bound of Theorem 1.1 from Theorems 1.3 and 1.4. Section 4 contains a result of independent interest, Theorem 4.1, which asserts that for Thurston maps with , is surjective if and only if it is nontrivial. Section 5 contains several results showing how the size bound controls the geometry of , of , and of . Sections 6 and 7 give, respectively, the proofs of Theorems 1.3 and 1.4. Section 8 concludes the proof of Theorem 1.1 by establishing the sharpness assertion: it gives a sequence of obstructed examples for which the heights of the obstructions grow more than polynomially in the geometric sizes.
Acknowledgements K. Pilgrim was supported by Simons grant 245269. The authors also acknowledge support from the AIM “SQuaRE” program.
2. Notation
Before proceeding to the proofs, we establish in this section some notation, conventions, and terminology.
All surface branched coverings and homeomorphisms considered here are orientation-preserving.
The square pillowcase group and its subgroups. Our two-sphere and set of four points are as defined in the introduction. Its affine automorphism group is then naturally identified with the (impure) mapping class group . We refer to the elements of as translations. The pure mapping class group is identified with .
Slopes and cusps. Slopes are denoted using the letter ; cusps denoted using the letter . Both slopes and cusps are extended rational numbers, elements of .
Thurston maps. All Thurston maps considered here will be defined as maps on the standard square pillowcase and by definition are orientation-preserving. The degree of is denoted . Under pullback induced by , images of slopes and cusps under and are generally denoted with primes.
The upper half-plane . To simplify notation for the present discussion, we denote by .
Just as is gotten from by pulling back complex structures, we obtain a pullback map for every . Note that translations act trivially. The action is not quite the obvious one, since it is induced via pullback: as in [7, Section 6] and [12, Proposition 4.1], if has matrix , then has matrix . In this way we obtain a right action of on so that for and .
We denote by the hyperbolic distance on induced by the line element .
Liftables. Given a Thurston map , there is a distinguished subgroup of –the “pure liftable” elements–comprised of those classes represented by homeomorphisms for which is isotopic relative to to for some . The assignment defines the virtual endomorphism . The pullback map and virtual endomorphism are related by the functional equation . See [13].
3. Deriving the height bound
In this section, we deduce statement 1 of Theorem 1.1 from Theorems 1.3 and 1.4. Statement 2 is proved in Section 8.
Proof.
We will use the following lemma, which contains three standard facts about continued fractions.
Lemma 3.1**.**
Let be a regular continued fraction. So are integers, and if . Let for be its convergents. Set , , and . Then the following statements hold.
- (1)
* and for * 2. (2)
* for * 3. (3)
**
Continued fractions.. We will work with finite regular continued fractions throughout this proof. When we write , it is assumed that this is a regular continued fraction with integers such that for .
Every rational number can be represented in exactly two ways as a finite regular continued fraction:
[TABLE]
We will work with both of these representations of . So despite writing equations as in the last display (an abuse of notation), we must distinguish between finite regular continued fractions and the rational numbers which they represent. The last display is to be interpreted as saying that both continued fractions represent . Given one of the two continued fraction expansions of a rational number , the sequence of convergents associated to this expansion is well-defined; it is not, however, well-defined given merely itself.
Finally, we will find it convenient to extend the definition of convergent as follows. Given a rational number and an expansion and an integer , we define the -convergent of this expansion to be the rational number .
We begin the proof of Theorem 1.1 proper. Suppose that and . Let be the bound on the length of the continued fraction expansion of a cusp satisfying given by Theorem 1.3. We will show the existence of a finite set of cusps depending on only and such that the cusp in the statement of Theorem 1.1 must lie in . We will construct as an ascending union of finite sets . The sets will be defined inductively as a collection of cusps whose continued fraction expansions satisfy a certain property.
To initialize, we set .
The construction of is slightly different from the construction of in general, so we perform it separately. If is the negative reciprocal of the slope of an obstruction with multiplier 1, then there is nothing to prove. Otherwise let be the excluded deleted-at-infinity interval provided by Theorem 1.4, and let be the largest negative integer in . We let
[TABLE]
The point of choosing in this way is that if is a negative integer in other than , then for every choice of positive integers and because . It is clear that if is a positive integer in , then for every choice of positive integers and because . So if represents a cusp fixed by , then .
We will want to control heights of elements of too. We will also do this inductively. For the base case, note from Theorem 1.4 that there exists a universal constant for which .
Here is the inductive step. Suppose . Our inductive hypothesis is (i) that the set contains the -convergent of every finite regular continued fraction which represents a cusp fixed by and (ii) we have constructed an upper bound on the heights of the elements of . Note that the height bound implies is finite. If contains the negative reciprocal of the slope of an obstruction with multiplier 1, then the construction stops here. We set and proceed to the estimation of at the end of this proof. Otherwise, we may assume that every cusp has a deleted interval as in Theorem 1.4.
Here is the definition of :
[TABLE]
In other words: for each element of , consider those cusps represented by a continued fraction which extends that of by one more partial quotient
[TABLE]
Then lies in if and only if .
We now check the inductive step. Suppose is a cusp fixed by . By the inductive hypothesis, contains the -convergent of . We first claim that contains the -convergent of . To verify this, there are a few cases to consider, depending on how compares with :
- •
If , then the and -convergent of is , and so .
- •
If , then the -convergent of is . Let . The fixed cusp cannot lie in the excluded interval , so by the definition of .
- •
Now suppose . Let and . We proceed by contradiction: suppose . Recall the inductive hypothesis asserts . The definition of then implies that . The rationals , are consecutive convergents of . So line 3 of Lemma 3.1 implies that is strictly between and . Since , a deleted excluded interval about , we conclude . But is a fixed cusp, so this is impossible by Theorem 1.4. We conclude .
We next estimate the heights of the elements of in terms of . Let . Let , let and let if and let if . Of course, , , , are integers with , and . Then . Line 1 of Lemma 3.1 implies that . Line 2 of Lemma 3.1 applied to the convergents and implies that
[TABLE]
Theorem 1.4 provides the existence of a universal constant such that the radii of the excluded intervals about finite elements of are at least . It follows that if , then is in the excluded interval about . Since this is not the case, it follows that , that is, . Thus , where is a universal constant which may be taken to be . We conclude that we may set
[TABLE]
We obtain by induction
[TABLE]
where the constants are universal.
Proceeding in this way, we eventually construct . Theorem 1.3 implies that if and , then . Thus , and we have the desired bound on . In particular, the height of a cusp fixed by is at most
[TABLE]
where is an absolute constant and is the constant from Theorem 1.3.
This proves Theorem 1.1. ∎
4. The slope function is surjective or trivial
This brief section proves a foundational result using part of the correspondence on moduli space associated to . We remark that can indeed be trivial; see [6].
Theorem 4.1** (The slope function is surjective or trivial).**
Suppose is an arbitrary Thurston map on the standard square pillowcase with . Then is surjective on if and only if it is not identically the constant function . Equivalently, the extension of to is surjective on cusps if and only if is not a constant function.
Proof.
Necessity follows from [13, Theorem 5.1]. We now prove sufficiency. Suppose is nontrivial. Since , it suffices to show is surjective on cusps of .
Let us here for convenience denote by . For each liftable and , we have the functional equation
[TABLE]
It follows that we obtain the commutative diagram below, much as in [13, Figure 2]; the space is ; the space is ; the vertical map is the usual holomorphic universal covering; the space is ; the maps and are holomorphic; the remaining maps are holomorphic covering maps.
[TABLE]
Since is nontrivial, is nontrivial, and and are nonconstant. Since is finite ([13, Prop. 3.1]), is isomorphic to a compact Riemann surface punctured at finitely many points, so the map is surjective on ends.
Now suppose is a cusp of the upper right copy of . Let be its image cusp in . The aforementioned surjectivity yields at upper left and with . The cusps and project to the same point . Hence there exists with . By the functional equation, we have then as required. ∎
5. How size controls geometry
In this section, we suppose is a presentation diagram and the corresponding NET map. We further assume . We maintain .
Our first elementary observation is that ; we use this repeatedly without mention in making further estimates.
This brings us to the following result.
Proposition 5.1**.**
The index of the pure liftables satisfies
[TABLE]
Moreover, contains the projectivized principal congruence subgroup .
Proof.
Proposition 3.4 of [12] provides an estimate for the index of the modular group liftables for in the modular group of . That proof and the fact that the index of the pure modular group in the modular group is 24 yield the first inequality and the final statement. The second inequality comes from the product factor for the prime 2. ∎
Proposition 5.2** (Small cusps mapping to each cusp in moduli space).**
Suppose is not a constant map. Let . Then for each end , there exists a cusp with and .
Proof.
Let . Theorem 4.1 implies that there exists a cusp with . Moreover, if then
[TABLE]
It remains to show that we can find simple cusps in .
Proposition 5.1 asserts that the group of liftable pure modular group elements contains the projectivized principal congruence subgroup where . Thus there exists a finite set of coset representatives for in each of which has entries in . Since acts transitively on , it follows that the orbit contains an element of the set . Since the entries of lie in we conclude that it is possible to find such that .
This proves Proposition 5.2. ∎
The proof of the next result uses the geometry of the dynamical plane, so it is initially formulated in terms of slopes, as opposed to cusps.
Proposition 5.3** (Linear height distortion).**
If is a slope such that , then where . Thus for cusps such that , we have correspondingly that .
It is easy to see that such an upper bound must be at least linear in .
Proof.
Recall the algorithm from [7, Section 5] for evaluating given the presentation diagram . Let and be the integer lattice vectors determined by . Let be the lattice generated by and . Let be the parallelogram displayed in . Let be the group generated by for , so that is a fundamental domain for . We tile with the -translates of . The connected components of the union of the -translates of the green arcs in are called spin mirrors.
Now let such that . Suppose that and , where , and , are two pairs of relatively prime integers. Here we briefly recall how we compute . Let be the local covering degree associated to slope . We choose an appropriately generic point , and we let . We imagine a photon starting at and beginning to travel in a line toward (hence in the direction of ). It travels toward until it hits a spin mirror. At the spin mirror, it rotates degrees about the midpoint of the spin mirror and then proceeds in the direction of . It continues in this way, traveling in the direction of either or . Every time that it hits a spin mirror, it rotates degrees about the midpoint of the spin mirror and reverses direction. Let be the point the photon reaches after traveling a distance along the line segments with direction (hence not counting spins). Then is an integer multiple of . We use this description of and to estimate their sizes.
Let be the line segment with endpoints and . By definition, the distance that the photon travels while traveling parallel to is the length of . The distance that it travels during spins is at most the sum of the lengths of the spin mirrors which meets.
Next let for every . Let and . Let be the matrix whose columns are and , and let be the linear transformation defined by . Then . So is at most the -length of plus the sum of the -lengths of the spin mirror images under which meets.
Now we estimate . Using the fact that , we have that
[TABLE]
It remains to estimate what the spin mirrors contribute to . Note that is the rectangle with corners at , , and . The map transforms the tiling of by translates of to a tiling of by translates of this rectangle. So the -length of the image under of every spin mirror is at most 4. The midpoint of each of these spin mirror images is a lattice point in .
We finally estimate the number of lattice points in which lie in tiles of which meet . We may choose so that contains no lattice points and the coordinates of the endpoints of are not integers. Let be the union of all closed rectangles with width 2, height 1 and corners in which meet . (Not all of these are in .) Let , respectively , be the absolute value of the difference of the , respectively , coordinates of the endpoints of . So . An induction argument based on the number of points in which have an integer coordinate proves that the number of lattice points in is . See Figure 3, where lattice points are drawn with squares, lattice points are drawn with circles and 8 lattice points are drawn with ’s. So the spin mirror contribution to is at most .
Assembling the above and using the fact that , we have that
[TABLE]
This proves Proposition 5.3. ∎
Below, denotes hyperbolic distance.
Theorem 5.4** (Bounded displacement of basepoint).**
We have
[TABLE]
the implicit constant is universal.
Easy examples show that this displacement can be at least a constant times , so the form of the estimate is sharp.
Proof.
Proposition 5.2 provides cusps , of heights at most such that their images , under lie in the cusp orbits and , respectively. Thus neither , is the point at infinity. Setting to be the constant from Proposition 5.3, we conclude . This implies that , , and . Let . Sacrificing tightness of bounds for convenience of exposition, we conclude:
[TABLE]
Let be the unique closed horoball tangent to for which the horocycle contains the basepoint . On the corresponding basepoint (square) torus , the family of curves with slope has modulus . The height bound from the previous paragraph gives . The Grötzsch inequality implies that on the torus , the modulus of the family of curves with slope satisfies . The locus in where the modulus of the curve family with slope is exactly is the circle tangent to of Euclidean radius . Using the inequality , it follows that lies inside the intersection of the closed horoballs tangent to and of Euclidean radius . Again sacrificing tightness of bounds for convenience of exposition, we conclude , where is the closed horoball tangent to of Euclidean radius .
In this paragraph, we bound the hyperbolic diameter of . Recall the horoballs have common Euclidean radius . It follows that the maximum value of occurs when . Since is a hyperbolic isometry, to compute we may assume that the horoballs have radius 1 and that . An easy calculation gives , where . Since for , we find that .
In this paragraph, we bound the hyperbolic distance from to . Since and has radius , we have that . Hence the path which runs vertically from to joins and . Hence the hyperbolic distance from to is at most .
Combining the previous two paragraphs, we conclude , as required. ∎
6. Fixed cusps have short continued fraction expansions
We prove Theorem 1.3 in this section. The idea is quite simple. Let be a geodesic from the basepoint to the boundary of the unit modulus horoball tangent to a fixed cusp . Theorem 5.4 says the size bound controls the hyperbolic distance . We will prove that if the continued fraction expansion of is long, the hyperbolic length of is much smaller than that of . Since is fixed, . But this is impossible.
Proof.
We begin with an elementary observation about the hyperbolic geometry of a regular ideal quadrilateral . Consider Figure 4, which shows outlined in bold lines in the disk model of the hyperbolic plane.
Let be the distance between opposite sides of . Let be the union of the two closed hyperbolic -neighborhoods of the two geodesics perpendicular to each pair of opposite sides. If is a hyperbolic geodesic meeting opposite sides of , then the intersection of with is a segment of length at least .
The moduli space is a quotient of obtained by side-pairings with isometries. Let be the image of under this natural projection, and its lift to the upper half-plane, where is the canonical quotient map. Since is compact, and since is a continuous function on a finite cover of moduli space (from Section 4 or [8, Lemma 5.2]), there is a real number such that
[TABLE]
Composing by an element of changes by composition with an isometry, so depends only on the modular group Hurwitz class of as defined in [12].
Now suppose is a fixed cusp. We may assume . Let , so that the nonnegative integer is the length of this continued fraction. Let for relatively prime integers , and let be the closed horoball tangent to of radius . The Grötzsch inequality implies that is contained in the closed horoball tangent to of radius . To ease notation in the displays below, we write for hyperbolic distance. Note that .
Let be the closure of the segment of the geodesic from the basepoint to , and its hyperbolic length. Let . Then joins to and so by the previous paragraph and the triangle inequality
[TABLE]
We will show
[TABLE]
Assuming inequality (1) for the moment, we conclude that
[TABLE]
Appealing to Theorem 5.4, we conclude
[TABLE]
where the constant depends only on the Hurwitz class of and the constant is universal. This gives the conclusion of Theorem 1.3.
We now establish inequality (1). Consider Figure 5. This draws the hyperbolic plane in the band model, and the geodesic through and asymptotic to as the horizontal line of symmetry of the band. The triangles drawn represent, combinatorially, the Farey tiling.
The convergents of are . The quadrilaterals, such as the one shaded, whose interior geodesic joins two consecutive convergents of are Farey quadrilaterals. The horoball is chosen so that its interior is disjoint from every Farey quadrilateral which does not have a vertex at . So must join opposite sides of every Farey quadrilateral corresponding to convergent pairs . Let , be the subsegments of comprising the intersections of with these Farey quadrilaterals, so that , and let . Let and . Then
[TABLE]
as required. ∎
7. Quantitative excluded intervals
Here we prove Theorem 1.4
Proof.
We begin by recalling notation. Let be a slope, and let be the cusp . Temporarily abusing notation, we set even if , which corresponds to . Thus if then . We write and , the corresponding multiplier. We have . The proof of Theorem 1.4 divides into cases not only along the lines of the two parts of its conclusion, but also according to whether or not the cusp falls into one of a few exceptional cases determined by the condition . We will treat these various cases using Lemma 7.3 and 7.4. The following table summarizes the cases and bounds obtained.
[TABLE]
The implicit constants are universal.
Corollary 7.3 of [18] implies the following theorem.
Theorem 7.1**.**
Suppose that and that with . Then the set of real numbers defined by
[TABLE]
does not contain a cusp fixed by .
We use this theorem to prove the following lemmas.
Lemma 7.3** **(Excluded intervals for nonexceptional
cusps).
Suppose that and that is a cusp fixed by .
- (1)
If , then , where . 2. (2)
If , then , where .
Proof.
Suppose that and with . So and . Theorem 7.1 states that the set of real numbers which satisfy the inequality in line 7.2 does not contain a cusp fixed by .
First suppose that , so that , and . Then because . We take as in Proposition 5.3. We note that because . So if , then
[TABLE]
This shows that satisfies line 7.2, proving statement 1.
Now to prove statement 2, suppose that , equivalently, . We rewrite line 7.2 as , where . We want to choose the real number in the statement of the lemma so that the interval lies in the interval about with endpoints and . It suffices to choose so that
[TABLE]
To estimate this minimum, we set . Then
[TABLE]
This proves Lemma 7.3.
∎
Lemma 7.4** **(Excluded intervals for exceptional
cusps).
Suppose that and if , then . Suppose is a cusp fixed by .
- (1)
If , then , where . 2. (2)
If , then , where .
Proof.
We first prove statement 1. Suppose that .
Proposition 5.2 implies that there exists a slope such that , , and . So is a finite cusp such that is a finite cusp.
Now we introduce the stabilizer of the cusp . Let be the primitive, positive Dehn twist about the curve of slope . Suppose that has essential nonperipheral preimages, each mapping by degree , so that . Then, up to homotopy,
[TABLE]
The map on induced by is , so
[TABLE]
Because if , it follows that maps to a different finite cusp for all but at most one integer .
Next let . The previous paragraph shows that we may argue as in the proof of statement 2 of Lemma 7.3, replacing there by for all but at most one value of . Let with . Then and .
Our next goal is to find a positive integer so that if , then we can find an excluded interval about with radius greater than . The union of these intervals over such sufficiently large integers will give us . So let
[TABLE]
Arguing as in the proof of statement 2 of Lemma 7.3, we want
[TABLE]
Set . Then assuming that does not fix ,
[TABLE]
We want this to be at least . So we want
[TABLE]
So setting
[TABLE]
if , then we have an excluded interval about with radius greater than . Note that if fixes , then the right side of the large display above is 0. Since it is not 0, does not fix if . So the union of these excluded intervals contains by taking
[TABLE]
This proves statement 1.
Now we consider statement 2. The strategy of this proof is to conjugate so that moves to in order to reduce to statement 1. For this we construct a homeomorphism induced by an element of , viewing as a subgroup of the modular group of . We choose the first column of to consist of and . To define the second column of , first suppose that . We express as a regular continued fraction. The last convergent of this continued fraction is . Let be the previous convergent for integers , with . We temporarily choose the second column of to consist of and . Then , as in statement 2 of Lemma 3.1. We multiply the second column of by if necessary so that . If , then we simply take and . Let . The map on the square pillowcase induced by is .
Now we set , a NET map. The NET map is given by a diagram with size . Let be the defining matrix for this diagram. Then, as in Section 6 of [11], a defining matrix for is . We have that . Since heights of successive convergents increase, . It follows that there exists a presentation diagram for with size at most .
We are prepared to consider pullback maps on . Let , and be the pullback maps of , and . Then . As in Section 6 of [10] or Proposition 4.1 of [12], we have that
[TABLE]
So . Hence transforms an excluded interval for about to an excluded interval for about . Statement 1 applied to yields a value of . It suffices to choose so that it is no larger than the distances from to . We compute:
[TABLE]
This proves statement 2.
∎
Lemmas 7.3 and 7.4 imply Theorem 1.4. ∎
8. A sequence of NET maps with large obstruction slope heights
This section is devoted to proving statement 2 of Theorem 1.1.
We begin by mentioning that since translations act trivially on slopes, the choice of translation term–the vector circled in the presentation diagram–does not affect the slope function or multiplier function of a NET map . A virtual NET map presentation diagram is such a diagram without such a choice of translation term. Thus each virtual presentation diagram corresponds to a priori at most four NET maps: we circle either 0, , or in the diagram. In low degree cases, such as the one we discuss here, the number of corresponding NET maps might be less than four, since some choices of translation term may yield maps with fewer than four postcritical points, as required in the definition of NET map. Thus the set of non-Euclidean NET maps produced by a virtual NET map presentation diagram consists either entirely of unobstructed maps, or entirely of obstructed maps, each with a common obstruction.
We will construct an infinite sequence of degree 2 NET map virtual presentation diagrams for integers . It will be clear from the construction that . We will show that the non-Euclidean NET maps defined by with are obstructed. Let be the slope of the unique obstruction for such a diagram with respect to the marking of determined by . We will then show that grows roughly as . So the height of the slope of the obstruction of grows faster than every polynomial in the geometric size of .
We will actually obtain a bit more. The diagram is only a virtual NET map presentation diagram because no element of is circled. We will find that circling three of the elements 0, , or obtains NET maps. The fourth Thurston map has only three postcritical points. The dynamic portraits of these three NET maps–invariants describing the dynamics and local degrees on the set of critical points and their forward orbits–are mutually inequivalent, so these three NET maps are mutually inequivalent. In Theorem 8.3 we will show for that the three equivalence classes of NET maps arising from are independent of .
Remark. Our analysis also shows that for each with that each NET map arising from diagram is equivalent to one arising from . The computer program NETmap says that each NET map in is equivalent to a rational map.
Definition of . Let be a nonnegative integer. We define the virtual NET map presentation diagram so that and . One verifies that the determinant of the matrix whose columns are and is 2 and that the parallelogram whose vertices are 0, , and contains . We choose green line segments in this parallelogram so that only one is nontrivial and its endpoints are and . This defines . Clearly . Figure 6 shows and .
Twist relationship. There is a natural action of on diagrams: just apply the linear map induced by the matrix to the diagram; see [11]. Here we find for which .
One easily verifies that
[TABLE]
As in Theorem 1.2 of [11], this means that where
[TABLE]
Dynamic portraits. We compute dynamic portraits of NET maps as in Section 10 of [12]. Postcritical points which are not critical are images in of 0, , and . Let , , and denote these images in . Let and denote the two critical points with postcritical. Straightforward computations yield the following dynamic portraits for , identified by the parity of and which lattice point of is circled.
even:
circle 0 (not NET): \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{1}+\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}
circle : \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{\lambda_{1}+\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}
circle : \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{1}+\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}
circle : \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\hskip 5.0pt\overline{\lambda_{1}+\lambda_{2}}\text{ }}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}
odd:
circle 0: \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{1}+\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}
circle : \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\;\overline{\lambda_{1}+\lambda_{2}}}$$\scriptstyle{1}
circle : \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\overline{\lambda_{2}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\;\overline{\lambda_{1}+\lambda_{2}}}$$\scriptstyle{1}
circle (not NET): \textstyle{\alpha\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}$$\textstyle{\overline{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{1}$$\textstyle{\hskip 5.0pt\overline{\lambda_{1}+\lambda_{2}}\text{ }}$$\scriptstyle{1}$$\textstyle{\beta\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\scriptstyle{2}
We find that the four portraits for even integers are isomorphic to the four portraits for odd integers . One of these four portraits has only three postcritical points, and so the corresponding Thurston map is not a NET map. The other three Thurston maps are NET maps whose dynamic portraits are mutually inequivalent, so these three NET maps are mutually inequivalent.
Modular group liftables associated to . For convenience, let us here set
[TABLE]
viewed as the modular group of the square pillowcase. Let denote the subgroup of liftables for in , defined as the subgroup of elements which lift under some (equivalently, any) NET map defined by the virtual diagram to another element . Generally, is multivalued, due to the possible presence of deck transformations. But using Proposition 3.5 of [12], one verifies that the modular group virtual multi-endomorphism associated to is actually an endomorphism, that is, it is single valued. Given , let denote its image under this modular group virtual endomorphism.
We define two affine maps so that
[TABLE]
As in Proposition 3.2 of [12], one verifies that and determine two elements of . The images of and in generate , the subgroup arising from matrices congruent to the identity modulo 2.
Now we consider the action of on slopes. As in Section 6 of [10], if is represented by , then the pullback map induced by on slopes of simple closed curves is represented by . This and the previous two paragraphs imply that the set of maps of the form for contains .
Continuing with slopes, let be the slope function associated to . Then, as usual, for every . This leads us to define a group homomorphism from to so that if , then this group homomorphism maps to . It follows that for every .
We next define five elements , , , , in the -factor of by way of matrices as follows:
[TABLE]
The first four are parabolic. Their index is the slope which they fix. Two elements in are
[TABLE]
We wish to compute and . This can be done as in Section 6 of [10] by using functional equations to compute two boundary values at the rationals, since this suffices to determine an element of . This computation requires knowledge of some values of . We compute:
[TABLE]
This leads to the following two commutative diagrams of maps of pairs.
[TABLE]
We conclude that
[TABLE]
and
[TABLE]
Translation equivalence. We say that NET maps and on the square pillowcase are translation equivalent if and only if there exists a translation such that and are isotopic. This is an equivalence relation because the set of translations is a subgroup of the modular group. We write to signify that and are translation equivalent. Changing the circled lattice point in a NET map presentation diagram changes the original NET map to one which is translation equivalent to it.
Because the set of translations is a normal subgroup of the modular group, both twisting and conjugating by an element of the modular group respects translation equivalence. To be specific, let and be NET maps on the square pillowcase, and let . If , then conjugation by maps the set of NET maps translation equivalent to to the set of NET maps translation equivalent to . Similarly, if , then postcomposition by maps the set of NET maps translation equivalent to to the set of NET maps translation equivalent to .
Let be a NET map arising from (by circling either , or ). The last two displays imply that
[TABLE]
Few equivalence classes. The following theorem implies that the presentation diagrams produce very few equivalence classes of NET maps. Theorem 8.3 makes this precise for the case in which . To simplify notation, we use juxtaposition of functions to signify composition.
Theorem 8.2**.**
For an integer let be a NET map arising from and let . Then and .
Proof.
The twist relationship between and implies that . One verifies the following identities.
[TABLE]
Using this, the display immediately preceding this theorem and the fact that conjugating and twisting respect translation equivalence, the first assertion can be proved as follows.
[TABLE]
The second assertion can be proved similarly after observing that .
[TABLE]
∎
We are going to analyze the sequence of sets of NET maps arising from diagrams with . In order to apply the previous Theorem 8.2, there will be two cases depending on whether is even or odd.
Theorem 8.3**.**
Let be a positive integer such that . Then every NET map arising from is conjugate to a NET map arising from .
Proof.
Suppose and is a NET map arising from . Suppose first is odd. Write and note that also . Theorem 8.2 implies is equivalent to a map produced from . If is even then and similarly is equivalent to a map produced from . Induction yields the result. ∎
The obstruction theorem. Here is the main result of this section.
Theorem 8.4**.**
Let be a nonnegative integer with . Then every NET map arising from is obstructed. Let be the slope of this obstruction. For a nonnegative integer let and . Then:
- (1)
** 2. (2)
If is odd, then . 3. (3)
If is even, then .
Proof.
Using Figure 6, it is easy to see for every NET map arising from that every simple closed curve with slope pulls back to a simple closed curve with slope . Only one connected component of the preimage is essential and nonperipheral, and it maps to with degree 1. So is an obstruction with multiplier 1. This proves that every NET map arising from is obstructed with obstruction slope .
Now suppose . Statements 2 and 3 follow from Theorem 8.2: conjugation by sends the obstruction of to the obstruction of , and the presence of and location of obstructions is unaffected by composition with translations. Finally, a straightforward induction argument proves that every NET map arising from is obstructed. This proves Theorem 8.4.
∎
Recall that if is represented by , then is represented by . Using this and line 8.1, we find that
[TABLE]
This explicit form of and Theorem 8.4 allow for the computation of for small values of . See Table 1.
Asymptotics of . We begin to estimate with the following lemma.
Lemma 8.5**.**
Let be an integer with and . Then the following statements hold.
- (1)
** 2. (2)
If for an integer , then . 3. (3)
If for an integer , then .
Proof.
Let be an integer with . Using the above explicit form of , we find that
[TABLE]
Since preserves orientation, it follows that maps the interval into the interval . This, Theorem 8.4 and induction prove statement 1. Statement 1 and Theorem 8.4 easily imply statements 2 and 3. This proves Lemma 8.5.
∎
Statements 2 and 3 of Lemma 8.5 lead to two more lemmas. Here is the first of these.
Lemma 8.6**.**
Let be a function which is constant on the interval such that for some positive real number and . Then there exists a positive real number such that for every sufficiently large real number .
Proof.
The assumptions imply that there exists a positive real number such that if , then
[TABLE]
where the number of pairs of brackets is either or . The last bracketed term is at least , and every bracketed term is more than 2 times the succeeding term. So
[TABLE]
Since , it follows that . Hence
[TABLE]
for some positive real number and every sufficiently large real number .
This proves Lemma 8.6.
∎
Lemma 8.7**.**
Let be a function which is constant on the interval such that for some positive real number and . Then there exists a positive real number such that for every sufficiently large real number .
Proof.
The assumptions imply that there exists a positive real number such that if , then
[TABLE]
where the number of pairs of brackets is . Each of the terms of the form is at least 2, which is greater than the finite geometric series which follows it. So
[TABLE]
Since , we have that . Hence
[TABLE]
for some positive real number and every sufficiently large real number .
This proves Lemma 8.7.
∎
Now we can estimate the height of .
Theorem 8.8**.**
There exists a positive real number such that
[TABLE]
for every sufficiently large positive integer such that .
Proof.
To obtain the lower bound on , we prove that there exists a function as in Lemma 8.6 such that for every nonnegative integer with . Define recursively by if and if . We have that because . Now suppose that , that , that and that . Using Lemma 8.5 and the fact that is increasing,
[TABLE]
as desired. If and , then
[TABLE]
This establishes the lower bound on .
For the upper bound, we apply Lemma 8.7 with the function for which and for . Because the argument for the upper bound is so similar to the argument for the lower bound, we simply give the estimates which establish the upper bound:
[TABLE]
and
[TABLE]
This completes the proof of Theorem 8.8.
∎
Theorem 8.8 shows that the function in Theorem 1.1 cannot be taken to be a polynomial in even if we restrict attention to only negative reciprocals of slopes of obstructions. This completes the proof of Theorem 1.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. Bartholdi, IMG, a Gap package , https://github.com/gap-packages/img .
- 2[2] L. Bartholdi and D. Dudko, Algorithmic aspects of branched coverings . Ann. Fac. Sci. Toulouse Math. (6) 26 (2017), no. 5, 1219–1296.
- 3[3] L. Bartholdi and D. Dudko, Algorithmic aspects of branched coverings V/V: symbolic and floating-point operations. In preparation, 2018.
- 4[4] L. Bartholdi and V. Nekrashevych, Thurston equivalence of topological polynomials , Acta Math. 197 (2006), 1–51.
- 5[5] S. Bonnot, M. Braverman, and M. Yampolsky, Thurston equivalence to a rational map is decidable , Mosc. Math. J. 12 (2012), no. 4, pp. 747-763.
- 6[6] X. Buff, A. Epstein, S. Koch, and K. Pilgrim, On Thurston’s pullback map , In Complex Dynamics–Families and Friends , pp. 561–583. A. K. Peters, Wellesley, MA 2009.
- 7[7] J. W. Cannon, W. J. Floyd, W. R. Parry and K. M. Pilgrim, Nearly Euclidean Thurston maps , Conform. Geom. Dyn. 16 (2012), 209–255 (electronic).
- 8[8] A. Douady and J. H. Hubbard, A proof of Thurston’s topological characterization of rational functions , Acta Math. 171 (1993), 263–297.
