Escaping Endpoints Explode

In 1988, Mayer proved the remarkable fact that ∞\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\infty $$\end{document} is an explosion point for the set E(fa)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(f_a)$$\end{document} of endpoints of the Julia set of fa:C→C;ez+a\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$f_a:\mathbb {C}\rightarrow \mathbb {C}; \mathrm{e}^z+a$$\end{document} with a<-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a<-1$$\end{document}; that is, the set E(fa)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(f_a)$$\end{document} is totally separated (in particular, it does not have any non-trivial connected subsets), but E(fa)∪{∞}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E(f_a)\cup \{\infty \}$$\end{document} is connected. Answering a question of Schleicher, we extend this result to the set E~(fa)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{E}(f_a)$$\end{document} of escaping endpoints in the sense of Schleicher and Zimmer, for any parameter a∈C\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a\in \mathbb {C}$$\end{document} for which the singular value a belongs to an attracting or parabolic basin, has a finite orbit, or escapes to infinity under iteration (as well as many other classes of parameters). Furthermore, we extend one direction of the theorem to much greater generality, by proving that the set E~(f)∪{∞}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tilde{E}(f)\cup \{\infty \}$$\end{document} is connected for any transcendental entire function f of finite order with bounded singular set. We also discuss corresponding results for all endpoints in the case of exponential maps; to do so, we establish a version of Thurston’s no wandering triangles theorem for exponential maps.


Introduction
A point x 0 is called an explosion point of a metric space X if X is connected but X \{x 0 } is totally separated. The latter means that, for any a, b ∈ X \{x 0 }, there are open sets U a , U b ⊂ X such that a ∈ U a , b ∈ U b , U a ∪ U b = X and U a ∩ U b = {x 0 }. If X is connected but X \{x 0 } is totally disconnected, then x 0 is called a dispersion point of X .
In this article, we typically consider the case of X = A ∪ {∞}, where A ⊂ C, and ∞ is an explosion/dispersion point of X . Slightly abusing terminology, we shall then also say that ∞ is an explosion/dispersion point for A.
Clearly every explosion point is also a dispersion point, but the converse is not true. Indeed, in 1921, Knaster and Kuratowski first gave an example of a space having a dispersion point, now known as the Knaster-Kuratowski fan [18,Ex. α,§5]. This fan does not have an explosion point; note that in particular this gives an example of a space that is totally disconnected but not totally separated. Wilder [45] constructed the first example of a space having an explosion point shortly afterwards, in 1923. Another famous example of a space having an explosion point, which is of key importance for this paper, is the set of endpoints of the Lelek fan (see Sect. 2), constructed by Lelek [19, §9] in 1961. It is tempting to think of such spaces as "pathological". However, Mayer [20] showed that explosion points occur very naturally within the iteration of transcendental entire functions.
To explain his result, recall that the Julia set J ( f ) of a transcendental entire function f consists of the points at which the family ( f n ) ∞ n=1 of the iterates of f is not equicontinuous with respect to the spherical metric (in other words, this is where the function behaves "chaotically"). Its complement F( f ) := C\J ( f ) is called the Fatou set. The iteration of transcendental entire functions has enjoyed significant attention recently. The family of quadratic polynomials z → z 2 + c, which gives rise to the famous Mandelbrot set, has been studied intensively as a prototype of polynomial and rational dynamics. Similarly, complex exponential maps f a : C → C; z → e z + a, (1.1) form the simplest space of transcendental entire functions. (Compare [7,34] for a discussion of connections between the two families.) Hence there is considerable interest in understanding the fine structure of the Julia sets of the functions f a .
In the case where a ∈ (−∞, −1), it is known [12, Thm. on p. 50] that J ( f a ) consists of uncountably many curves, each connecting a finite endpoint to infinity. It is easy to see that this set E( f a ) of endpoints is totally separated; Mayer proved that E( f a ) ∪ {∞} is connected, and hence has ∞ as an explosion point. In fact, by work of Aarts and Oversteegen [1], J ( f a ) ∪ {∞} is homeomorphic to the Lelek fan for these parameters.
For general a ∈ C, the Julia set no longer has such a simple structure. Nonetheless, there is still a natural notion of "rays" or "hairs", generalising the curves mentioned above. While some of these may no longer land at finite endpoints [11,31], Schleicher and Zimmer [42] have shown that there is always a setẼ( f a ) of escaping endpoints, which moreover has a certain universal combinatorial structure that is independent of the parameter a, making it a natural object for dynamical considerations. For the purpose of this introduction, we define the relevant concepts as follows; see Sect. 4, and in particular Corollary 4.5, for further discussion.  In this article, we provide a positive answer to this question for a large class of parameters a.  Remark The hypotheses of the theorem are quite natural and general, and have appeared previously in the study of exponential maps [31,33]. They are known to hold, in particular, whenever f a has an attracting or parabolic orbit and when the singular value a escapes to infinity [42], is preperiodic [43] or non-recurrent [5]. It is likely that there are some parameters a ∈ C for which the hypotheses fail; compare Sect. 8. However, the hypotheses can be weakened to a condition that, conjecturally, holds whenever f a does not have an irrationally indifferent periodic point; see Theorem 8.1.
By definition, the proof of Theorem 1.3 requires two steps: on the one hand, we must show thatẼ( f a ) ∪ {∞} is connected, and on the other thatẼ( f a ) is totally separated. It turns out that the first can be carried out in complete generality.

Theorem 1.4 (Escaping endpoints connect to infinity)
The setẼ( f a ) ∪ {∞} is connected for all a ∈ C.
Remark Our proof shows thatẼ( f a ) can be replaced by the setẼ( f a ) ∩ A( f a ) of all endpoints belonging to the fast escaping set; see Remark 4.6. (The set A( f a ) consists of all points that escape to infinity "as fast as possible", and has played an important role in recent work on transcendental dynamics; compare [37].) We remark that this result is new even for a ∈ (−∞, −1). Indeed, our strategy of proof is to establish the theorem first in this setting, using a topological model introduced in [30], and then infer the general case using a conjugacy result also proved in [30].
In the opposite direction, under the hypotheses of Theorem 1.3 we are able to employ combinatorial techniques to conclude thatẼ( f a ) is indeed totally separated. Without such hypotheses, the answer to Question 1.2 turns out to depend on extremely difficult problems concerning the possible accumulation behaviour of rays in the dynamical plane. For example, it is widely believed that a path-connected component of the escaping set of an exponential map cannot be dense in the plane [28,Question 7.1.33].
(The nature of the path-connected components of I ( f a ) is well known: each such component-with the exception, in certain well-understood cases, of countably many additional curves-is one of the afore-mentioned dynamics rays. See [16,Cor. 4.3].) However, the corresponding question (whether an external ray can ever accumulate on the whole Julia set) remains open, as far as we are aware, even for quadratic polynomials. The following result shows that Question 1.2 is at least as difficult. Theorem 1.5 (Separating escaping endpoints is hard) Suppose that, for some parameter a ∈ C, the set I ( f a ) has a path-connected component that is dense in the Julia set. ThenẼ( f a ) is connected.
However, as we discuss in Sect. 8, it appears quite likely that the answer to Question 1.2 is always positive. The set of all endpoints. The set E( f a ) ⊃Ẽ( f a ) of all endpoints of an exponential map f a is a less universal object than that of escaping endpoints, since its structure may vary considerably with the parameter a. Nonetheless, one can ask the analogue of Question 1.2 for this set. The setẼ( f a ) of escaping endpoints is completely invariant under f a , and hence dense in the Julia set. Thus, by Theorem 1.4, the set E( f a ) ∪ {∞} contains a dense connected subset for all a ∈ C, and is, therefore, connected. In the opposite direction, we are able to prove the following. (See Sect. 6 for the definition of the kneading sequence.) Theorem 1.7 (Endpoints disperse) Let a ∈ C, and suppose that the singular value a of the function f a satisfies one of the following conditions.
(a) a belongs to the Fatou set; (b) a is an endpoint or on a hair, and its kneading sequence is non-periodic.
Then ∞ is a dispersion point for E( f a ); in the case of (a), ∞ is also an explosion point.
The proof of Theorem 1.7 requires a more detailed combinatorial analysis than that of Theorem 1.3. In particular, we establish a combinatorial version of Thurston's no wandering triangles theorem for exponential maps (Theorem 6.13). The following consequence of the latter result may be of independent interest. Theorem 1.8 (No wandering triods) Let f a be an exponential map. Suppose that z 0 is an endpoint of f a that is accessible from I ( f a ) in at least three different ways; that is, there are three arcs in I ( f a ) ∪ {z 0 } that contain z 0 and are otherwise pairwise disjoint.
Then z 0 is eventually periodic.
More general functions. In this article, we focus primarily on the family of exponential maps. However, there is a large class of transcendental entire functions for which the existence of rays, in analogy to the exponential family, was established in [38] (and, independently, in [2] for a more restrictive class of maps). It makes sense to ask about the properties of the set of escaping endpoints in this context also. In this direction, we shall prove the following extension of Theorem  [3].) Theorem 1.9 (Escaping endpoints of functions with rays) Let f be a finite-order entire function with bounded singular value set S( f ), a finite composition of such functions, or more generally a function satisfying a "uniform head-start condition" in the sense of [38]. Then the setẼ( f ) ∪ {∞} is connected.
If, additionally, f is hyperbolic-that is, every singular value s ∈ S( f ) belongs to the basin of an attracting periodic orbit-then ∞ is an explosion point forẼ( f ).
Idea of the proofs. Establishing Theorem 1.3 for the case of a ∈ (−∞, −1) is the key step in our arguments. We shall do so using an explicit topological model for the dynamics of such f a on its Julia set, introduced in [30]. We review its definition and properties in Sect. 3. and then prove Theorem 1.4 in this case by showing that J ( f a ) contains an invariant subset A such that A ∪ {∞} is homeomorphic to the Lelek fan, and such that every endpoint of A is an escaping endpoint of f a .
We are able to transfer this result to the dynamical plane of any exponential map using a general conjugacy result from [30] (Theorem 4.1). To show thatẼ( f a ) is totally separated in the cases covered by Theorem 1.3, we review and apply combinatorial methods for exponential maps in Sect. 6. Theorem 1.7 is also proved there, using similar arguments but requiring the no wandering triangles theorem. Finally, we consider the case of more general entire functions in Sect. 7 and discuss further questions, including Conjecture 1.6, in Sect. 8.
Basic notation. As usual, C denotes the complex plane; its one-point compactification is the Riemann sphereĈ := C ∪ {∞}. The set of integer sequences s = s 0 s 1 s 2 . . . is denoted by Z N 0 ; if s 0 . . . s n−1 is a finite sequence of integer, then its periodic extension is denoted (s 0 . . . s n−1 ) ∞ ∈ Z N 0 .
Throughout the article (with the exception of Sect. 7), we consider the family ( f a ) a∈C of exponential maps defined by (1.1). This family is also often parameterised as (w → λe w ) λ∈C\{0} ; the families are conjugate via the change of coordinate z = w + a, with λ = e a . Our choice of parameterisation gives a slightly more convenient asymptotic description of dynamic rays (see the remarks on notation given in [36, p. 108], and also the discussion in Section 2.3 of [28]), but as we shall not require this additional information, the choice is primarily a matter of taste.

Lelek Fans, Straight Brushes and Cantor Bouquets
We begin by formally introducing the topological notions central to this paper (see e.g. [44,Sec. 4]). Definition 2.1 (Separation) Let X be a topological space, and let x 0 ∈ X .
(a) Two points a, b ∈ X are separated (in X ) if there is an open and closed subset U ⊂ X with a ∈ U and b / ∈ U . (b) The space X is called totally separated if any two points are separated in X . (c) The space X is called totally disconnected if it contains no non-trivial connected subset. (d) If X is connected and X \{x 0 } is totally separated, then x 0 is called an explosion point of X . (e) If X is connected and X \{x 0 } is totally disconnected, then x 0 is called a dispersion point of X .
The following-a version of the well-known fact that the continuous image of a connected space is connected-is immediate from the definitions.
We are usually interested in subsets of the plane, where the notion separation takes the following, particularly simple, form. (See [25,Thm V.4.3] or [33,Lem 3.1].) Lemma 2.3 (Separation in the plane) Let X ⊂ C, and let x, y ∈ X . Then x and y are separated in X if and only if there is a closed and connected set ⊂ C\X such that x and y belong to different connected components of C\ . The Lelek fan. As mentioned in the introduction, the Lelek fan will play an important role in our discussions. It can be defined as follows.

Definition 2.4 (Lelek fans)
Let X be a continuum, i.e. a compact, connected metric space. Then X is a fan (with top x 0 ∈ X ) if the following conditions are satisfied: (a) X is hereditarily unicoherent; that is, if A, B ⊂ X are subcontinua of X , then A ∩ B is connected. (b) X is arcwise connected. Hence, by (a), X is uniquely arcwise connected, and we use [x, y] to denote the arc connecting x, y ∈ X .
(c) x 0 is the only ramification point of X (that is, a common endpoint of at least three different arcs that are otherwise pairwise disjoint).
If x ∈ X is an endpoint of every arc containing it, then x is called an endpoint of X ; the set of all endpoints is denoted E(X ).
A fan X with top x 0 is called smooth if, for any sequence y n converging to a point y, the arcs [x 0 , y n ] converge to [x 0 , y] in the Hausdorff metric.
A smooth fan such that the endpoints of X are dense in X is called a Lelek fan.
In [19, §9], Lelek gave an example of a fan X with the above properties, and showed that E(X ) ∪ {x 0 } has x 0 as an explosion point. Our terminology above is justified by the fact, proved independently in [9, Cor. on p.33] and in [8], that any smooth fan with a dense set of endpoints is homeomorphic to that constructed by Lelek: Density. The set of α with t α < ∞ is dense in R. Furthermore, for every such α, there exist sequences (β n ) and (γ n ) such that β n α and γ n α, and such that t β n , t γ n → t α .
Compact sections. B is a closed subset of R 2 .
If B is a straight brush, then clearly its one-point compactification B ∪ {∞} is a smooth fan. Furthermore, since B is closed, the function α → t α is lower semicontinuous, and it follows easily that the set of endpoints is dense in B [1, Cor.  Remark The term "Cantor bouquet" has been used informally since the 1980s; in particular, Devaney and Tangerman [13, p. 491] give a definition of Cantor bouquets that differs from the one above. Definition 2.7 first appears in [10,Def. 3.3]. (We note that, in [10], the homeomorphism is not required to be ambient, but this appears to have been an oversight.) The following characterisation of Cantor Bouquets, in the spirit of Definition 2.4, will be useful, although strictly speaking we shall not require it. Moreover, if ϕ is any homeomorphism between Cantor bouquets that preserves the cyclic order of hairs at ∞, then ϕ extends to an orientation-preserving homeomorphism C → C.

Theorem 2.8 (Characterisation of Cantor bouquets) A closed set A ⊂ C is a Cantor bouquet if and only if
Remark To explain the hypothesis of the final statement, observe that any family of pairwise disjoint arcs in C, each having one finite endpoint and another endpoint at infinity, induces a natural cyclic order. By this we mean that there is a consistent notion of whether three such arcs γ 1 , γ 2 , γ 3 are ordered in positive or negative orientation. Indeed, if γ 1 and γ 2 are such arcs, then the set C\(D R (0) ∪ γ 1 ∪ γ 2 ) has precisely two unbounded connected components for sufficiently large R, one that lies between γ 1 and γ 2 (in positive orientation) and one that lies between γ 2 and γ 1 . If γ 3 tends to infinity in the latter, then the triple is ordered in positive orientation. It is easy to see that this does indeed define a cyclic order.
In our applications, all curves will have real parts tending to +∞, and in this case the cyclic order can be upgraded to a linear order, referred to as the vertical order. (The curve γ 1 is below γ 2 if γ 1 , γ 2 , α are ordered in positive orientation, where α is a horizontal line segment tending to −∞.) Sketch of proof. Let us call a closed set A ⊂ C a candidate bouquet if it satisfies (a) and (b). Note that any Cantor bouquet is a candidate bouquet. Now let A be a candidate bouquet; as explained above, there is a natural cyclic order on the set H of hairs of A. LetH be the order completion of this cyclic order. The elements ofH \H are in one-to-one correspondence with the set of homotopy classes of curves to infinity in C\A, and, using (b), the setH is easily seen to be order-isomorphic to a circle.
We can now compactify the plane to a spaceC = C∪H in such a way that each hair h of A ends at the corresponding point h ∈ H ⊂C. The spaceC is homeomorphic to the closed unit disc, and under this correspondence the set A ∪H becomes a one-sided hairy circle in the sense of [1, Def. 4.7] (essentially, a circle with a collection of hairs densely attached on one side).
By [1,Thm. 4.8], any two one-sided hairy circles X and Y are homeomorphic, and any such homeomorphism extends to a homeomorphism of the sphere. Observe that any homeomorphism must map the base circle of X to that of Y .
Applying this result to the above compactifications of two candidate bouquets A and B, we see that A and B are ambiently homeomorphic. Furthermore, any homeomorphism that preserves the cyclic order of the hairs will extend to a homeomorphism of their compactifications, and hence also to an orientation-preserving homeomorphism of the plane.
Remark Alternatively, the proof of Proposition 2.5 (as given in [8]) can be modified to show that, for any two candidate bouquets, there is a homeomorphism that preserves the cyclic order of hairs. The first part of the theorem thus follows from the second, which in turn can be proved in the same way as [1, Thm. 4.1].

A Topological Model for Exponential Maps
In [1, §1], it was shown that J ( f a ) is a Cantor Bouquet for a ∈ (−∞, −1). The straight brush constructed there was defined in dependence on the parameter a, and is hence not easy to analyse directly. Instead, we use a similar construction from [30], which has the advantage that the brush arises in a straightforward way from an abstract dynamical system F, defined without referring to a specific exponential map. As a result, the dynamics of F is easy to analyse, and furthermore can be connected to the dynamical plane of the exponential map f a for any a ∈ C. We now review the necessary definitions, and then prove the analogue of Theorem 1.3 for this model function.
For the remainder of the article, a sequence s = s 0 s 1 s 2 . . . ∈ Z N 0 of integers shall be called an (infinite) external address. Our model lives in the space R × Z N 0 (with the product topology). We denote the projection of x = (t, s) to the first and second coordinates by T (x) := t and addr(x) := s =: s 0 (x)s 1 (x) . . . for the projection maps to the first and second coordinates. We also fix the function F : [0, ∞) → [0, ∞); t → e t −1, which serves as a model for exponential growth. 1 We frequently use elementary properties of the function F that can be verified via high-school calculus. In particular, if t, δ ≥ 0, then

Definition 3.1 (A topological model for exponential dynamics [30]) Define
where σ denotes the shift map on one-sided infinite sequences. We set We also denote the one-point compactification of If s is exponentially bounded, then (t s , s) is called an endpoint of J (F); if additionally (t s , s) ∈ I (F), then it is called an escaping endpoint, and s is called fast. We write E(F) andẼ(F) for the sets of endpoints and escaping endpoints, respectively.
Remark In [30], J (F) was denoted asX , while I (F) was denoted as X . We prefer to use the above notation in analogy to exponential maps. Furthermore, external addresses were indexed beginning with index 1 (following the convention established in [42]). However, it seems more natural to begin with index 0; so, when comparing this paper with the relevant results in [30], all indices should be shifted by 1.
We refer to [30, §3] for further discussion of the motivation behind these definitions. It is proved in [30, §9] that F| J (F ) is topologically conjugate to the map f a on its Julia set, for every a ∈ (−∞, −1). In particular, as a consequence of [1], we see thatĴ (F) is a Lelek fan. In fact, we can say more if we considerĴ (F) as being embedded in R 2 as follows.
Observation 3.2 (Embedding in R 2 ) It is well known that Z N 0 (with respect to lexicographic order) is order-isomorphic to the set R\Q of all irrational numbers. Hence there is an order-preserving homeomorphism α : . In the following, we shall hence identify Z N 0 with the set of irrational numbers; thus J (F) can be thought of as a subset of R 2 , via the embedding (t, s) → (t, α(s)). For ease of terminology, we usually do not distinguish between J (F) and its image under this embedding.

Theorem 3.3 (The model is a straight brush) J (F) is a straight brush. HenceĴ (F) is a Lelek fan and ∞ is an explosion point for E(F).
Proof This is essentially proved in [1, Sect. 1.6], although the brush there is defined slightly differently. For this reason, we sketch how to prove the result directly. The fact that J (F) is closed in R 2 , as well as "hairiness", follows immediately from the definition of F and J (F); see [30,Observation 3.1]. (For any t ≥ 0 and any s ∈ N 0 , the set of addresses s with t s ≤ t and s 0 ≤ s is a compact subset of Z N 0 .) It is easy to see that t s < ∞ for any bounded sequence s (see Lemma 3.8 below), and hence the set of addresses with t s < ∞ is dense. Finally, given x ∈ J (F), it is easy to construct sequences that converge to x from both above and below; this is also a consequence of Theorem 3.10(b) below (take Q = 0).
Our main goal for the remainder of this section is to prove the following.

Theorem 3.4 (Escaping endpoints of F explode) The point ∞ is an explosion point forẼ(F).
Theorem 3.4 implies Theorem 1.3 in the case where a ∈ (−∞, −1). Moreover, for every exponential map f a , there is a correspondence between points in I (F) and the set of escaping points of f a (see Theorem 4.1 below), and hence the results proved in this section also aid us in establishing Theorem 1.3 in general.
The key idea is to identify suitable subsets ofĴ (F) that are still Lelek fans, but which have the property that all of their endpoints belong toẼ(F). The final claim in the theorem follows immediately from the following simple fact.

Observation 3.7 (Larger entries mean larger potentials) Let s
Hence t s ≥ t s 0 , as claimed. In particular, if s 0 is fast, then t σ n (s) ≥ t σ n (s 0 ) → ∞, and s is fast also.
To prove the first part of Theorem 3.6, we shall require some control over the minimal potentials t s , as provided by the following fact [30, Lem. 7.1], whose proof we include for the reader's convenience.

s is exponentially bounded if and only if t * s < ∞, and fast if and only if t
Proof The fact that t * s ≤ t s follows immediately from the observation that for n ≥ 1, and hence F −n (2π |s n |) ≤ t s . On the other hand, it is easy to see that (t * s + 1, s) ∈ J (F), and hence t * s + 1 ≥ t s , using the fact that F(t + 1) ≥ 2F(t) + 1 for all t ≥ 0.
We also use the following elementary fact about contraction under pullbacks of F. Observation 3.9 (Backwards shrinking) Let x, y ∈ J (F) and n ∈ N, and suppose that |s j (x)| = |s j (y)| for j = 1, . . . , n and that δ : Proof This is immediate from (3.1) and the definition of F.
Proof of Theorem 3.6 Since projection to the second coordinate is continuous with respect to the product topology, the set X s 0 (F) is closed in J (F). SinceX s 0 (F) is clearly connected as a union of intervals all of which have a common endpoint, it follows thatX s 0 (F) is a continuum. AsĴ (F) is a Lelek fan, we see thatX s 0 (F) is a smooth fan with top ∞. (Any non-trivial subcontinuum of a smooth fan is either an arc or a smooth fan.) To conclude thatX s 0 (F) is a Lelek fan, it remains to show that endpoints are dense in By Definition of F and J (F), we have and hence |s j n | ≥ |s n | ≥ |s 0 n | for all j ≥ 1 and n ≥ 0. So x j := (t s j , s j ) ∈ X s 0 (F) for all j. Furthermore, by Lemma 3.8 and (3.1), By Observation 3.9, Lemma 3.8 and (3.2), As already noted, the final claim of the theorem follows from Observation 3.7.
Proof of Theorem 3.4 Consider the projection map E(F) → Z N 0 to the second coordinate. This map is continuous, and injective by the definition of E(F). Since Z N 0 is totally separated, it follows that E(F) andẼ(F) ⊂ E(F) are totally separated. On the other hand, for any s 0 ∈ Z N 0 , let E(X s 0 (F)) denote the set of endpoints of X s 0 (F). By Theorem 3.6,X s 0 (F) is a Lelek fan, and hence E(X s 0 (F)) ∪ {∞} is connected by Proposition 2.5 and the definition of explosion points. Furthermore, by Theorem 3.6, E(X s 0 (F)) ⊂Ẽ(F) when s is fast, and hencẽ To deduce Theorem 1.4, we shall need a slightly stronger version of Theorem 3.4, which applies also to the set of points that remain far enough to the right under iteration of F.
Then J ≥Q (F) is a straight brush (using the embedding from Observation 3.2), and Remark For Q > 0, the Cantor bouquet J ≥Q (F) will have some endpoints that are escaping points of F, but are not endpoints of J (F). (Indeed, (Q, (0) ∞ ) is an example of such a point.) In other words, Proof Note that J ≥Q (F) is closed in J (F) by definition, proving the "compact sections" condition in Definition 2.6. "Hairiness" is also immediate from the definition: if (t, s) ∈ J ≥Q (F), then clearly (t , s) ∈ J ≥Q (F) for all t > t. Furthermore, let s ∈ Z N 0 be exponentially bounded. Then (t s + Q, s) ∈ J ≥Q (F), which implies the first part of the "density" condition for straight brushes. Thus, it remains to establish the second part of this condition (that for any given hair, there are sequences of hairs approximating it from above and below). This follows from (b), which we establish below. So J ≥Q (F) is indeed a straight brush.
To prove claim (a), suppose that x 0 = (t s 0 , s 0 ) ∈ J ≥Q (F), and let x ∈ X s 0 (F). Then we can apply Observation 3.7 to s 0 and s := addr(x), and all their iterates. Thus, for all j, as claimed. Now let us prove (b), which follows similarly as density of endpoints in the proof of Theorem 3.6. More precisely, let x = (t, s) ∈ J ≥Q (F); we may assume without loss of generality that x / ∈ E(F). (Otherwise, apply the result to a sequence of values with the same address as x and tending to x, and diagonalise.) In particular, We define addresses s j+ and s j− for j ≥ 0 by Then each address s j± is fast by (3.4) and Lemma 3.8. Furthermore, for all j ≥ 0 and n ≥ j + 1, and hence s j− < s < s j+ . Finally, for n ≥ j, and by Observation 3.9 also t σ n (s j± ) ≥ t n ≥ Q for n = 1, . . . , j − 1. Thus x j± := (t s j± , s j± ) ∈Ẽ ≥Q (F). The fact that x j± → x 0 as j → ∞ follows as in Theorem 3.6, and the proof of (b) is complete. Finally, (c) follows from (a) and (b) precisely as in the proof of Theorem 3.4 above.

Review of Exponential Dynamics and Proof of Theorem 1.4
We now review some key results concerning the dynamics of exponential maps. The following theorem [30,Thm. 4.2,Thm. 4.3] shows that, for any a ∈ C and sufficiently large Q > 0, the set J ≥Q (F) considered in the previous section captures the essential features of the escaping dynamics of f a .
Theorem 4.1 (Conjugacy between F and exponential maps) Let a ∈ C, and consider the exponential map f a : C → C; f a (z) = e z + a. If Q is sufficiently large, then there exists a closed forward-invariant set K ⊂ J ( f a ) and a homeomorphism g : J ≥Q (F) → K with the following properties.
(a) g is a conjugacy between F and f ; i.e. g • F = f a • g.
(c) The map g preserves vertical ordering; that is, if s 1 , s 2 ∈ Z N 0 are exponentially bounded addresses such that s 1 < s 2 with respect to lexicographical ordering, then the curve t → g(t, s 1 ) tends to infinity below the curve t → g(t, s 2 ). (d) There is a number R > 0 with the following property: if z ∈ C such that Re f n a (z) ≥ R for all n ≥ 0, then z ∈ K . Remark Part (c) is not stated in [30,Thm. 4.2,Thm. 4.3], but follows from the construction, as discussed on p. 1962 of the same paper.
Proof By Theorem 3.10, J ≥Q (F) is a straight brush. By part (c) of Theorem 4.1 and Theorem 2.8, the set K is a Cantor bouquet, and the claim follows from the second part of Theorem 2.8.
(We remark that, in this case, the compactification discussed in the proof of Theorem 2.8 is well known: it is obtained by adding to C all external addresses at infinity, together with the countable set of "intermediate external addresses" (see Definition 6.7 below). This space has the property that g(t, s) → s as t → ∞, for every exponentially bounded address s; compare [31, Rem. on p.357], and also [3, §5] for the same result in a more general setting. The compactification is known to be homeomorphic to the closed unit disc, and hence we can obtain the result directly from [1,Thm. 4.8] using this compactification, without requiring the more general Theorem 2.8.) To complete the proof of Theorem 1.4, we shall require two further ingredients. The first concerns pullbacks of unbounded sets under entire functions. The second ingredient concerns escaping endpoints: to prove Theorem 1.4, we need to know that the image of an escaping endpoint for F under the conjugacy g is also an escaping endpoint for the exponential map f a . With the usual definition of rays and endpoints for f a , as introduced in [42], this would be immediate. For our Definition 1.1-which is easier to state, but less natural-this is less obvious, but it was shown in [16] that the two notions coincide (compare [16,Rem. 4.4]). In particular, the following is shown there. Proof While this is not stated explicitly in this form in [16], it is a direct consequence of Theorem 4.2 given there, applied to the setting of Corollary 4.3 in the same paper. If x is a non-endpoint for J (F), then-by increasing the number n if necessary-we may assume that x is also a non-endpoint for J ≥Q (F), where Q is as in Theorem 4.1. It is then immediate that f n a (z) is on a hair, and by applying a local inverse of f −n a , we obtain an arc in I ( f ) containing z as an interior point, as required.
If x ∈Ẽ(F), then we see analogously that z is accessible from the escaping set I ( f a ). Hence, it only remains to prove that, if γ ⊂ I ( f a ) is an arc, then γ cannot contain x in its interior. This follows from Theorem 4.4 (again, increasing n if necessary).

Dense Path-Connected Components
We now prove Theorem 1.5, in the following more general form. The idea of the proof is as follows. If z 1 and z 2 were separated, then by Lemma 2.3, they could be separated by a closed subset of the plane, which by definition does not contain any escaping endpoints. However, this set would have to intersect C, which itself essentially sits within a Cantor bouquet (obtained by taking preimages of the set K from Theorem 4.1). We thus obtain a contradiction to Theorem 3.4. To make this precise, we notice the following simple fact.

Proposition 5.2 (Accessing Cantor bouquets) Let X ⊂ C be a Cantor bouquet, and let E ⊂ X be a dense subset of X such that E ∪ {∞} is connected.
Suppose that ⊂ X is a closed connected subset of C with ∩ E = ∅. Then every connected component I of ∩ X is either unbounded or contains an endpoint of X .
Proof Clearly it is enough to prove this in the case where X ⊂ R 2 is a straight brush. In this case, let us show the contrapositive. Suppose that I is bounded and does not contain an endpoint of X ; we will show that E ∪ {∞} is disconnected. Then I = [τ 1 , τ 2 ] × {α} for some α ∈ R\Q and t α < τ 1 ≤ τ 2 . Choose T 1 ∈ (t α , τ 1 ) and T 2 > τ 2 such that (T 1 , α), (T 2 , α) / ∈ . Consider the segment J := [T 1 , T 2 ] × {α}, and let δ > 0 be sufficiently small to ensure that (T j , β) / ∈ whenever j = 1, 2 and |α −β| ≤ δ. Let β + n α and β − n α be sequences of rational numbers converging to α from above and below such that |β σ n − α| ≤ δ for all n and σ ∈ {+, −}. Then the line segments J ± n := [T 1 , T 2 ] × {β ± n } converge to J from above and below and are disjoint from X . Consider the open rectangles R n ⊂ R 2 bounded by J + n and J − n together with the vertical line segments connecting their endpoints.
Fix some point y ∈ \X ; then ∂ R n 1 separates y from I for sufficiently large n 1 . Let K 1 be the closure of the connected component of K ∩ R n 1 that contains I . Then, by the boundary bumping theorem [24,Thm. 5.6], there is σ ∈ {+, −} such that K 1 intersects J σ n 1 . Now let n 2 > n 1 , and consider the "sub-rectangle" R σ n 1 ,n 2 of R n whose horizontal sides are J σ n 1 and J σ n 2 . By another application of the boundary bumping theorem, there is a compact connected subset K 2 ⊂ K 1 ∩ R σ n 1 ,n 2 that connects these two horizontal sides.
If n 2 is sufficiently large, then we can pick points a 1 , a 2 ∈ X ∩ R σ n 1 ,n 2 that are near the two vertical sides; by density of E we can furthermore assume that a 1 , a 2 ∈ E. Then K 2 separates a 1 and a 2 in R σ . Now let M < 0, and consider the set obtained as the union of K 2 , [M, T 2 ]×{β σ n 1 }, [M, T 2 ] × {β σ n 2 } and the vertical interval connecting the left endpoints of the latter two segments. The two horizontal intervals in and its left vertical side are disjoint from X , while K 2 ⊂ K is disjoint from E by assumption. So ∩ E = ∅. Moreover, clearly also separates a 1 from a 2 in C (this follows, for example, from Janiszewski's theorem [27, p. 31]). This proves that E ∪ {∞} is disconnected, as required.  ([0, 1])) ⊂ K , where K is the Cantor Bouquet from Theorem 4.1. In particular, γ n is an arc. If V n is a sufficiently small neighbourhood of γ n , then we can find a branch ϕ n of f −n a on V n that takes γ n to γ and extends continuously to ∂ V n . Set V := ϕ n (V n ).
Let 0 be the connected component of ∩ V containing ζ 0 ; by the boundary bumping theorem, we have 0 ∩ ∂ V = ∅. Now we can apply Proposition 5.2 to the Cantor Bouquet K , the set E :=Ẽ( f ) ∩ K (which has the desired properties by Theorem 3.10), and the continuum n := f n ( 0 ). Note that n ⊂ K since n ⊂ γ n .
By construction, n ∩ E = ∅, but the connected component of n ∩ X containing f n (z 0 ) belongs to the interior of the arc γ n , and hence is bounded and contains no endpoint of K . This is a contradiction.

Maps with Accessible Singular Values
The key point about the hypotheses in Theorem 1.3 is that the singular value a can be connected to ∞ by a curve γ that either belongs to the Fatou set (if a ∈ F( f a )) or is a piece of a "dynamic ray" in the escaping set (see below). The preimage of γ , which contains no endpoints, then cuts the complex plane into countably many strips, and we can study symbolic dynamics by considering the "itineraries" of different points with respect to this partition. Definition 6.1 (Itineraries) Let f : C → C be a continuous function, and let ⊂ C be a closed set. We say that z ∈ C has an itinerary with respect to if f n (z) / ∈ for all n ≥ 0. In this case, the itinerary of z is defined to be the sequence of connected components of C\ visited by f n (z), for n ≥ 0.
In particular, two such points z and w have the same itinerary if f n (z) and f n (w) belong to a common connected component of C\ for all n; otherwise, they have different itineraries.
When two points have different itineraries, they can clearly be separated within the set of endpoints: Observation 6.2 (Separation from itineraries) Let f : C → C be a continuous function, and let ⊂ C be a closed set. Suppose that z, w ∈ C have different itineraries with respect to . Then z and w are separated in C\ n≥0 f −n ( ).
Proof Let n 0 ≥ 0 be such that f n 0 (z) and f n 0 (w) belong to different connected components of C\ . Since is closed, the two points are also separated in C\ . Then z and w are separated in C\ f −n 0 ( ) by Observation 2.2.
Dynamic rays of exponential maps. A full description of the escaping set of an arbitrary exponential map in terms of dynamic rays was first given in [42]. We shall now review their definition and basic properties.

Definition 6.3 (Dynamic rays)
Let f a be an exponential map. A dynamic ray of f a is a maximal injective continuous curve g : (0, ∞) → I ( f a ) such that (a) lim t→∞ Re f n a (g(t)) = ∞ uniformly in n, and (b) for all t 0 > 0, lim n→∞ Re f n a (g(t)) = ∞ uniformly for t ≥ t 0 . If additionally z 0 := lim t→0 g(t) is defined, then we say that g lands at z 0 .
We shall use the following basic properties of dynamic rays. (a) For every exponentially bounded external address s ∈ Z N 0 , there is a unique (up to reparameterisation) dynamic ray g s such that addr(g −1 (g s (t))) = s for all sufficiently large t. Conversely, if g is a dynamic ray of f a , then g = g s for some s (again up to reparameterisation).

(b) The vertical order of dynamic rays (for t → ∞) coincides with the lexicographical ordering of their external addresses. (c) If z ∈ I ( f ) is on a hair, then either z is on a unique dynamic ray, or there is n 0 ≥ 1 such that f n (z) is on a unique dynamic ray containing the singular value a. (d) If z is an endpoint of f a , then either z is the landing point of a dynamic ray (which
is unique if additionally z ∈ I ( f )), or there is n 0 ≥ 1 such that f n 0 (z) is the landing point of the unique dynamic ray containing the singular value a.
Proof These are well-known properties of dynamic rays (compare [42] or [30]), and follow easily from Theorem 4.1 and Corollary 4.5.
Curves at the singular value. We now study exponential functions satisfying the assumptions of Theorem 1.3. For every such map f a , we can find a natural curve connecting the singular value to ∞. The preimages of this curve give rise to a natural dynamical partition of the Julia set. The study of these partitions, and of the resulting itineraries, is well developed. Here we shall present the basic facts we require and refer e.g. to [31,35,43] for further background. Let us first consider the case where a / ∈ F( f a ). Then Theorem 6.4 immediately implies the following.

Corollary 6.5 (Rays landing at singular values) Suppose that f a is an exponential map for which a is either an endpoint or on a hair. Then there is an exponentially bounded address s such that either g s lands at a, or a ∈ g s .
Now consider the case where the singular value belongs to the Fatou set. The following is well known, and follows from the fact that a is the unique singular value of f a , and that exponential maps have no wandering domains.

Observation 6.6 (Singular values in the Fatou set) Let f a be an exponential map. Then a ∈ F( f a ) if and only if f a has an attracting or parabolic cycle. In this case, there is a unique cycle of periodic components of the Fatou set, and a belongs to one of the components of this cycle.
If the component U of F( f a ) containing the singular value has period n, we can connect a and f n a (a) by an arc γ 0 in U . Let γ be the component of f −n a (γ 0 ) containing a; then γ is a curve connecting a to ∞ in U . To associate symbolic dynamics to the curve γ , we should "fill in the gaps" within Z N 0 with finite sequences called "intermediate external addresses"; compare [39, §3] or [35, §2]. Let f a be an exponential map and let γ ⊂ C\I ( f a ) be a curve connecting some finite endpoint to infinity. Then we say that addr(γ ) = s ∈ S if, for any exponentially bounded addresses r 1 , r 2 , the three curves g r 1 [1, ∞) , γ and g r 2 [1, ∞) are ordered in positive orientation with respect to cyclic order at infinity whenever r 1 < s < r 2 with respect to the cyclic order on S.
Remark 1 At first, the notion of a curve having address s may seem to depend on the parameterisation of dynamic rays. However, this is not the case, since using different "tails" of the same ray will result in the same cyclic order; the interval [1, ∞) is used merely for convenient notation.

Remark 2
Since the cyclic order on S is order-complete (in fact, the space is isomorphic to the circle), addr(γ ) is defined for every curve γ as in Definition 6.7. Observe that, if addr(γ ) = ∞, then Re z → +∞ along γ . In particular, f (γ ) is then also a curve to infinity, and addr( f a (γ )) = σ (addr(γ )). Now let us return to our case of an exponential map f a having an attracting or parabolic orbit, and the curve γ defined above. Clearly we have addr( f n−1 a (γ )) = ∞, and hence addr(γ ) is an intermediate external address of length n. Itineraries and escaping endpoints. For the remainder of the section, we fix an exponential map f a satisfying the hypotheses of Theorem 1.3, the curve γ connecting a to ∞ constructed above, and the associated address s ∈ S; that is, if a is an endpoint or on a hair, then γ is the piece of g s beginning at a, where g s is the ray from Corollary 6.5. If a ∈ F( f a ), then γ and s = addr(γ ) are as defined above. In either case, γ contains no endpoints, except possibly a itself, and s is either intermediate or exponentially bounded.

Remark
In the case where a belongs to an invariant component of the Fatou set, the construction above leads to a curve γ having real parts tending to −∞, and hence having address s = ∞. This choice, while correct, would require us to introduce some tedious notation for special cases below. Instead, we simply note that we can always replace γ by a piece of its preimage, extended to connect to the singular value; this curve will then have an address in S. (We remark that the case where s = ∞ is trivial, anyway, since here no two rays can share the same itinerary, and E( f a ) is thus totally separated. In fact, it is well known that the Julia set is then a Cantor bouquet.) In the following, we will hence always suppose that s = ∞.
consists of countably many curves from −∞ to +∞, which cut the plane into countably many strips, and we can study itineraries with respect to = f −1 (γ ) (in the sense of Definition 6.1) in purely combinatorial terms. Remark Compare [35, §3] for a further discussion of combinatorial itineraries and kneading sequences. There, itineraries are also defined for intermediate external addresses, and iterated preimages of the address s. In particular, for simplicity, our definition of the kneading sequence for periodic s is slightly different from-and less accurate than-that given in [35]; in particular, for our purposes periodic addresses do not have periodic kneading sequences. By Observation 6.2, if two exponentially bounded addresses as above have different combinatorial itineraries, then the corresponding two rays and their landing points are separated by n≥1 f −n a (γ ) ⊂ I ( f a )\E( f a ). Hence we can prove results about the separation of endpoints by studying the properties of sets of addresses sharing the same itinerary. The following simple observation shows that the itineraries of such addresses must satisfy certain restrictions in terms of the kneading sequence. Furthermore, let j ≥ 1 with r 1 j−1 = r 2 j−1 . Then, for all k ≥ 0, m j+k = u for some ≤ k, where u := K(s).

Remark
In the case where s is intermediate or periodic, the final statement implies, in particular, that m j+k agrees with one of the finitely many integer entries of u.
The following will allow us to complete the proof of Theorem 1.3. Proposition 6.10 (Addresses sharing an itinerary are slow) Let s ∈ S be either intermediate or exponentially bounded. If r 1 = r 2 are such that the itineraries itin s (r 1 ) and itin s (r 2 ) are defined and coincide, then r 1 and r 2 are slow.
Proof By the first part of Lemma 6.9, the addresses r 1 and r 2 differ at infinitely many indices. Furthermore, if s is exponentially bounded, we have t := t s < ∞; by Lemma 3.8, 2π |s n | ≤ F n (t * s ) ≤ F n (t s ) for all n ≥ 0. On the other hand, if s is intermediate of length K , then it contains only finitely many entries, and we can choose t such that 2π |s n | ≤ F n (t) for n ≤ K − 2.
Let N ≥ 1 be such that r 1 N −1 = r 2 N −1 . Then, by Lemma 6.9, we have 2π |r for all n ≥ N and j = 1, 2. Hence t * σ N (r j ) ≤ t + 2π . Since N can be chosen arbitrarily large, we see that r 1 and r 2 are slow, as claimed.
Proof of Theorem 1.3 By Theorem 1.4, it remains to show thatẼ( f a ) is totally separated for all a ∈ C satisfying the hypotheses of the theorem.
So let z, w ∈Ẽ( f a ) with z = w. By Observation 6.2, it is enough to show that z n := f n a (z) and w n := f n a (w) are separated by f −1 a (γ ) for some n ≥ 0. (Here γ is the curve connecting the singular value to ∞, as above.) If z n+1 = w n+1 for some (minimal) n ≥ 0, then z n and w n differ by a non-zero integer multiple of 2πi, and are hence separated by f −1 (γ ), as desired.
So suppose that z n = w n for all n. By Theorem 6.4(d), there is n ≥ 0 such that z n and w n are landing points of two dynamic rays g r z and g r w , at fast external addresses. If n is large enough, then neither r z nor r w is mapped to the address s of γ under iteration of the shift map.
By Proposition 6.10, we have itin s (r z ) = itin s (r w ). If j is the first index at which the two itineraries differ, then g σ j (r z ) and g σ j (r w ) , and hence z n+ j and w n+ j , are separated by f −1 (γ ), and the proof is complete.
Itineraries and arbitrary endpoints. To also prove Theorem 1.7 in the case where a / ∈ F( f a ), we shall use the following combinatorial statement, which concerns addresses sharing an itinerary in general. Proposition 6.11 (Number of addresses sharing a common itinerary) Let s ∈ S and let m ∈ Z N 0 . Let R denote the set of external addresses whose itinerary with respect to s is defined and agrees with m.
If m is periodic or preperiodic, and σ j (m) = K(s) for all sufficiently large j ≥ 0, then R is a finite set of periodic or preperiodic addresses (all having the same period and pre-period). If m is not eventually periodic, then #R ≤ 2.

Remark 1
The hypothesis of the proposition is necessary. Indeed, suppose that K(s) is periodic; recall that for us this implies that s itself is not a periodic address. If σ j (m) = K(s) for some j ≥ 0, then the set R consists of uncountably many addresses. (The reader may think, by way of illustration, of the case of an exponential map with a Siegel disc. Although it is not known whether there are such maps for which the singular value is the landing point of a ray, this is conjectured to be true at least for certain rotation numbers; compare [31]. In this case, we may think of R as representing the addresses of those dynamic rays that accumulate on the boundary of the Siegel disc.)

Remark 2
In the periodic case, more can be said than is stated in the proposition. For example, the addresses in R belong to at most two periodic cycles; if #R > 2, then they belong to a single cycle; see [39,Lem. 5.2].
Proof First suppose that m is eventually periodic. We may assume that m is periodic; otherwise, we apply the proposition to a periodic iterate of m under the shift, and obtain the result for m by pulling back corresponding to the finitely many initial entries of m.
We claim that, under the above assumptions, R consists of periodic or preperiodic addresses, of period n. (However, it may be that R = ∅, which is impossible in the case covered by [35,Lem. 3.8].) Indeed, assume without loss of generality that j = 0, and let p be the period of the itinerary m. Then p divides n; say n = p · q. We consider the set R obtained by adding to R the orbit of s under σ p .
Claim The set R is mapped bijectively to itself under σ p , and σ p preserves the cyclic ordering of addresses in R .
Proof We first prove that the claims hold for R. Recall that all addresses in R have itinerary m, which is an infinite sequence of integers (in particular, no address in R is on the backward orbit of s). For every j ≥ 0, all addresses of σ j (R) belong to the interval (m j s, (m j + 1)s), and the shift map is injective on each such interval and preserves the cyclic ordering. Furthermore, if r ∈ R, then there is a unique preimage of r under σ p whose itinerary begins with m 0 m 1 . . . m p−1 , and which hence also belongs to R. (Here we use the fact that s is periodic, so that r -whose itinerary is an infinite sequence of integers by assumption-is not on the orbit of s under the shift map.) Now σ n is clearly also bijective on R . The reasoning that it preserves the circular ordering is the same as above-here σ p−1 (R ) also includes exactly one of the two boundary addresses of (m j s, (m j + 1)s), but this does not affect the argument.
Letñ be the minimal period of a periodic address r in R (soñ is a multiple of p and divides n). Then σñ maps R to itself, preserving the cyclic ordering and fixing r . Let t ∈ R ; then, in the cyclic order, either So σ jñ (t) is an eventually monotone, and hence convergent, sequence in Z N 0 . But this is possible only if t is itself periodic of period at mostñ. Hence, all addresses in R are periodic of periodñ = n, as claimed. Furthermore, the set of sequences of period n in R is clearly finite: for any t ∈ R, we have t j ∈ {m j , m j − 1} for all j, so there are at most 2 n such addresses. (In fact, as alluded to in Remark 2 above, there are far fewer: either #R = 0 or #R = 1; we do not require this fact). The case where m is not eventually periodic is Thurston's no wandering triangles theorem, adapted to our context. See, e.g. [41,Thm. 3.3] for a proof in the case of unicritical polynomials. We are not aware of a published proof for exponential maps, and hence provide the argument in Theorem 6.13 below.
No wandering triangles. Let us begin by introducing some notation. A set A ⊂ Z N 0 is called a wandering gap (for the one-sided shift σ on Z N 0 ) if #σ n (A) ≥ 3 for all n ≥ 0 and the sets σ n 1 (A) and σ n 2 (A) are disjoint and unlinked for all non-negative n 1 = n 2 . If #A = 3, then A is also called a wandering triangle.
The condition of "exponential combinatorial type" is motivated precisely by the dynamics and combinatorics of exponential maps as discussed above; see also Observation 6.14. Assuming this condition, we can now prove the absence of wandering gaps. (In general, wandering gaps do exist for the shift map on any number n ≥ 3 of symbols [6], and by the same reasoning they exist also for the shift on infinitely many symbols.) Theorem 6.13 (No wandering triangles) There are no wandering gaps of exponential combinatorial type.
Proof Since every wandering gap contains a wandering triangle, it is enough to prove the absence of wandering triangles of exponential combinatorial type; hence the name of the theorem. So suppose, by contradiction, that there is such a wandering triangle T , and define T n := σ n (T ) for n ≥ 0. Let T denote the set of all T n and their translates; recall that, by assumption, the elements of T are pairwise disjoint and pairwise unlinked. For ease of notation, we also write r + m for the translate of an address r by m; that is, r + m = (r 0 + m)r 1 r 2 r 3 . . . .
In particular, σ | T preserves the cyclic ordering of addresses, and any two addresses in T differ by at most 1 from each other in every entry.
Proof The first claim is immediate from the fact that T is unlinked with its translates, and implies the second claim (since σ preserves cyclical order when restricted to the interval between an address and its translate by 1). The final statement follows from the first, applied to σ n (T ) for all n ≥ 0.
For two addresses r 1 , r 2 , let us write N (r 1 , r 2 ) for the index of the first entry in which these two addresses differ. For any triangle T ∈ T , also write N (T ) for the largest value of N (r 1 , r 2 ) for two different r 1 , r 2 ∈ T .
Observation 2 If T ∈ T is a triangle, then there is t ∈ T such that N (t, r ) < N (T ) for the other addresses r ∈ T \{t}.
Proof Let T = {r 1 , r 2 , t}, where N (r 1 , r 2 ) = N := N (T ). By Observation 1, at position N , there are only two possible choices for the entry of each address in T . In particular, t does not differ from one of the two other addresses, say r 1 , at position N . By definition of N (T ), we must have N (t, r 1 ) < N . Since r 1 and r 2 agree up to entry N − 1, we also have N (t, r 1 ) = N (t, r 2 ).
Observation 3 There are n 2 > n 1 > 0 such that N 1 := N (T n 1 ) ≥ N (T n 1 −1 ) and Proof This is trivial if N (T n ) is unbounded as n → ∞. Otherwise, there are infinitely many n for which and we choose two of these that are sufficiently large to ensure that N (T n ) ≤ N 1 for all n ≥ n 1 − 1. (Note that, in this case, N 1 = N 2 .) Let n 1 and n 2 be as in Observation 3; we may assume furthermore that n 2 > n 1 is chosen to be minimal. LetT 1 andT 2 be translates of T n 1 −1 and T n 2 −1 , chosen to contain an address having initial entry 0, but no address with initial entry −1. (This is possible by Observation 1.) In particular, σ (T j ) = T n j for j = 1, 2, and by minimality of n 2 .
Observation 4 For j = 1, 2, the triangleT j contains two addresses r j,0 and r j,1 such that r j, 0 = for = 0, 1, and such that N (r j,1 , r j,0 +1) = N (r j,0 , r j,1 −1) = N j +1. Furthermore, the third address t ∈T j differs from one of these two addresses at position 0, and from the other in an entry at a position ≤ N j .
Proof If two addresses t 0 = t 1 differ first in the N th entry, and have t 0 0 = t 1 0 , then their images under the shift map clearly differ first in the (N − 1)th entry, and thus N (σ (t 0 ), σ (t 1 )) = N (t 0 , t 1 ) − 1. Now let t 1 < t 0 be the two addresses in T n j with N (t 1 , t 0 ) = N (T n j ), and let r j,1 and r j,0 be their preimages inT j . Then   N (r j,1 , r N (t 1 , t 0 ), and hence r j,1 and r j,0 differ in their initial entry.
It follows that r j, begins with the entry for = 0, 1, and that the two addresses agree in the next N j entries, proving the first claim.
The second claim follows from Observation 2 in a similar manner.
We can now reach the desired contradiction. Indeed, by Observation 1, the two trianglesT 1 andT 2 are unlinked. Since N 2 ≥ N 1 , it follows from Observation 4 that T 2 cannot belong to one of the bounded intervals of Z N 0 \T 1 , and thusT 2 is contained in the union of the two intervals (r 1,1 − 1, r 1,0 ) and (r 1,1 , r 1,0 + 1). In particular, there must be two addresses inT 2 that belong to the same of these two intervals, and hence agree in the first N 1 + 1 entries. So N (T 2 ) > N 1 , which contradicts (6.2).

Remark
The above proof follows similar ideas as the usual proof of the wandering triangles theorem in the polynomial case, with one notable exception. The first step in the latter proof is usually to observe that the smallest side in the iterates of a wandering triangle must become arbitrarily small (in our terminology, this would mean that N (T n ) → ∞ as n → ∞). In the polynomial case, this follows from an area argument [41,Lem. 2.11] which completely breaks down in the infinite-symbol case. This forces us to argue more carefully, observing that Observation 3 holds and is sufficient to conclude the proof, even if N (T n ) remained bounded. It is not clear whether this consideration is an artefact of the proof or a genuinely new phenomenon in the transcendental case; that is, for families of transcendental entire functions where wandering triangles do exist, do we always have N (T n ) → ∞?
The following observation links the notions of gaps, and Theorem 6.13, with itineraries of exponential maps.
Proof of Theorem 1.8 Suppose, by contradiction, that z 0 is as in Theorem 1.8, but that z 0 is not eventually periodic. By Theorem 6.4 (and since f n a is locally injective near z 0 ), there is n ≥ 0 such that f n (z 0 ) is the landing point of at least three dynamic rays, at addresses r 1 , r 2 , r 3 . These three addresses form a wandering triangle T . Since the three rays associated to any translate of any iterate of T also land together (due to the periodicity of the exponential map), the triangle is of exponential combinatorial type. This contradicts Theorem 6.13.
Attracting and parabolic examples. Recall that Theorem 1.7 claims that if f a is an exponential map such that a ∈ F( f a ), then E( f a ) is totally separated. This is a consequence of the following result. Proof This follows from the fact that, under the given hypotheses, all dynamic rays of f a land, and two dynamic rays land at the same point if and only if they have the same itinerary with respect to f −1 (γ ), where γ is certain curve connecting the singular value to ∞, constructed precisely as described above. (Note that, in the case where f a has an invariant Fatou component, we must now use a curve γ tending to −∞ and having addr(γ ) = ∞. It is then clear that any two dynamic rays at different addresses have different itineraries with respect to f −1 (γ ), and hence the claim is trivial in this case, as mentioned above.) In the case where f a has an attracting periodic orbit, the above claims are proved in [30,Prop. 9.2] as a consequence of the stronger Theorem 9.1 in the same paper. It is also remarked at the end of [30,Sect. 9] that these results remain true for parabolic parameters, although the details are not given.
We note that the proof of our proposition in the parabolic (and also in the attracting) case can be achieved with considerably less effort than the results of [30,Sect. 9]. Indeed, by Lemma 6.9, the claim is trivial for endpoints of rays at unbounded external addresses. Furthermore, for eventually periodic addresses (and hence for periodic itineraries, by Proposition 6.11), the claim is proved in [43,Prop. 4.5].
So let g r 1 and g r 2 be two rays at bounded addresses, sharing the same (bounded) itinerary m which is not eventually periodic. (Note that, in particular, σ j (m) is distinct from the itinerary of the parabolic orbit of f a , for all j ≥ 0.) We must show that, if both rays land, they land at the same point in C.
It follows from a simple hyperbolic contraction argument (similar to that in the proof of [30,Prop. 9.2]) that, for any bounded itinerary which does not eventually agree with that of the parabolic orbit, there is a unique point z 0 with a bounded orbit which has this itinerary. Furthermore, any other point with the same itinerary must tend to infinity under iteration. Because the landing points of g r 1 and g r 2 cannot be escaping (only rays at fast addresses land at escaping points), it follows that both rays land at z 0 . This completes the proof.
Proof of Theorem 1.7 If f a is an exponential map with a ∈ F( f a ), then (as mentioned above), f a has an attracting or parabolic periodic orbit. It follows from Proposition 6.15, together with Observation 6.2, that E( f a ) is totally separated.
On the other hand, suppose that f a is an exponential map such that the singular value a is an endpoint or on a hair, and let γ ⊂ g s be the curve connecting a to ∞, as above. Assume furthermore (as in the hypothesis of the theorem) that the kneading sequence K(s) is not periodic; we must show that E( f a ) is totally disconnected.
So let X be a connected component of E( f a ). Then all points of X share the same itinerary m with respect to f −1 a (γ ). By passing to a forward iterate, we may assume that σ j (m) = K(s) for all j ≥ 0. In particular, each z ∈ X is the landing point of some dynamic ray g r , where itin s (r ) = m. By Proposition 6.11, the set of possible such addresses is finite, and hence X is finite. Since X is connected, it follows that it consists of a single point, as desired.

Beyond the Exponential Family
To prove Theorem 1.9, we use similar ideas as in the proof of Theorem 1.4, together with the results of [3,38], which establish the existence of Cantor bouquets in the Julia sets of the functions under consideration. The difference between the general case and that of exponential maps is that we do not have such explicit information about the position and behaviour of rays as we did through our model F. In particular, there may not be an analogue of the characterisation of "fast" addresses in terms of a simple growth condition. This means that, for some escaping endpoints, our argument would no longer yield a corresponding brush where all endpoints are escaping (i.e. there is no analogue of Observation 3.7). Furthermore, we do not have as precise control over the positions of endpoints as we utilised in the proof of Theorem 3.4.
However, both concerns are easily taken care of using more general arguments: We do not need to find a sub-brush for every fast address, but it is enough to exhibit one Lelek fan with the desired properties. Similarly, we can use softer arguments to establish the density of endpoints. In the following, we shall use the terminology of [3], and refer to that paper for further details and background. Remark 7.1 (Escaping endpoints) Let f satisfy the hypotheses of Theorem 1.9. Then there is again a natural notion of "escaping endpoints": these are those points z 0 ∈ I ( f ) with the following property. Let n 0 ≥ 0 be any number that is sufficiently large to ensure that the external address of f n 0 (z 0 ) is defined in the sense of [38]. If z = f n 0 (z 0 ) is an escaping point with the same external address, then | f n (z)| > | f n+n 0 (z 0 )| for all sufficiently large n.
If no critical point of f has an escaping orbit, then it is plausible that, again, no escaping endpoint belongs to the interior of an arc in the escaping set, and hence that there is an analogue of Definition 1.1 that yields the same notion. However, if f has an escaping critical point that is mapped to an escaping endpoint, then we can combine two preimage branches of a curve in I ( f ) that join at the critical point, and the two definitions no longer coincide.
Define an address s n by s n k := s k if k = n m n otherwise.
It follows from [14,Lem. 1] that i.e. f is strongly expanding with respect to the cylindrical metric |dz|/|z| when | f (z)| is large. The cylindrical distance between ζ m n and f n (z) remains bounded as n → ∞ by (7.1). This implies that e(s n ) → z, as desired.
In particular, the set A of endpoints of X has the property that A ∪{∞} is connected. The first part of the theorem follows using Lemma 4.3, in the same manner as in the proof of Theorem 1.7.
Suppose f is hyperbolic, and let |λ| be sufficiently small. Then the function f λ := λ f is hyperbolic with connected Fatou set; see [32, §5, p. 261]. As both maps are hyperbolic, it follows from [32, Thm. 1.4] that the escaping set I ( f ) is homeomorphic to the escaping set I ( f λ ), and that f and f λ are conjugate on these sets. Furthermore, the conjugacy maps escaping endpoints of f to escaping endpoints of f λ . (Indeed, hyperbolic functions have no escaping critical points. Hence, as discussed in Remark 7.1, escaping endpoints can be defined in terms of the topology of the set of all escaping points, and hence any homeomorphism between two escaping sets of hyperbolic functions must map escaping endpoints again to escaping endpoints. Alternatively, the claim can be deduced directly from the proof of [32,Thm. 1.4].) On the other hand, the Julia set of f λ is a Cantor Bouquet by [3, Thm. 1.5], and hence its set of endpoints is totally separated.
(We remark that Theorems 1.5 and 1.6 of [3], which we used in this proof, were stated only for functions that can be written as the composition of finite-order functions with bounded singular sets. However, by Corollaries 6.3 and 7.5 of the same paper, they hold more generally when f -or, more precisely, one of the logarithmic transforms of f -satisfies a uniform head-start condition in the sense of [38].) Remark 7.2 (Escaping endpoints in the strong sense) We remark that Theorem 1.9 likely still holds if an "endpoint" is defined analogously to Definition 1.1; to avoid confusion, let us refer to these as escaping endpoints in the strong sense. LetÃ be obtained from the set A constructed in the proof above by removing the grand orbits of all critical points.
It is easy to see that removing a countable set from the set of endpoints of a Lelek fan does not affect its explosion point property. (If X is a straight brush, and (α n ) ∞ n=1 is a sequence of irrational numbers, then choose small intervals I n with rational endpoints around each α n . If we remove all those points from X whose height belongs to one of the I n , the result (if non-empty) will still be a Cantor bouquet, and hence its set of endpoints has the explosion point property. By taking the union of the endpoints of these bouquets for all possible choices of I n , we obtain all endpoints apart from those at heights α n , as desired.) HenceÃ ∪ {∞} is also connected. Suppose furthermore that no "slow" ray-i.e. one on which the iterates do not escape to infinity uniformly-can land at an escaping endpoint. (It seems plausible that this is always true, but we are not aware of a proof; the argument for exponential maps relies on global periodicity and breaks down in general.) Then, as alluded to in Remark 7.1, every point that eventually maps toÃ will be an escaping endpoint in the strong sense. Hence the set of all escaping endpoints in the strong sense, together with infinity, is also connected.

Remark 7.3
The result in [32,Thm. 1.4] has been extended to a large class of "strongly subhyperbolic" entire functions by Mihaljević-Brandt [23], and hence ∞ is an explosion point forẼ( f ) also for these functions. It seems likely that similar combinatorial techniques as those used in Sect. 6 can be extended to entire functions as in Theorem 1.9, assuming that the set of singular values is finite, and that singular values satisfy similar accessibility conditions from the escaping set. In particular, we believe that ∞ is an explosion point forẼ( f ) whenever f is geometrically finite in the sense of [22]; see also [21,Ch. 5] for a discussion of itineraries for geometrically finite functions. However, we shall not pursue this question here.
On the other hand, in general the set of all endpoints will not be totally separated, or even disconnected. Indeed, for the map f (z) = π sin(z), every point in R is an endpoint [40]. It is easy to see that the union of iterated preimages of R is a connected set that is dense in the plane, and hence E( f ) is connected.
Finally, we note also that Theorem 1.5, as stated, does not extend to the functions covered by Theorem 1.9. Indeed, the escaping set of the function z → (cosh(z)) 2 has a dense path-connected component not containing any endpoints. This component is obtained by taking all iterated preimages of the real axis; see [37, pp. 804-805]. On the other hand (since the real axis contains no endpoints) the set of endpoints is disconnected, and indeed it seems likely that it is totally separated. The reason that the proof of Theorem 1.5 breaks down here is that, for maps with escaping critical points, it is no longer true that the escaping set locally contains the structure of a Cantor bouquet.

Do Escaping Endpoints Explode in General?
In this section, we discuss evidence for Conjecture 1.6. Let us begin by noting that it appears unlikely that the hypotheses of Theorem 1.3 hold for all a ∈ C. Indeed, suppose that f is a quadratic polynomial having a Cremer point (i.e. a non-linearisable periodic point of multiplier e 2πiα , with α ∈ R irrational). Then Kiwi [17,Cor. 1.2] has proved that the critical point of f is not accessible from the basin of infinity. It seems likely that, likewise, for an exponential map f a with a Cremer point, the singular value a is never the endpoint of a dynamic ray. Similarly, Perez-Marco [26] proved (according to Kiwi) the existence of infinitely renormalisable quadratic polynomials with inaccessible critical points; here all periodic cycles are repelling. Again, it is plausible that such examples exist for exponential maps also. Let us show how we can strengthen Theorem 1.3 to cover the latter case. To do so, we rely on similar ideas as before, but utilise a more detailed understanding of exponential combinatorics to remove the condition that the singular value is an endpoint or on a hair. We shall from now on assume familiarity with deeper results concerning the combinatorial structure of exponential parameter space, as established in [29,[34][35][36].
Theorem 8.1 (More escaping endpoints explode) Let a ∈ C be a parameter such that f a does not have an irrationally indifferent periodic orbit, and such that all repelling periodic points of f a are landing points of periodic dynamic rays. Then ∞ is an explosion point forẼ( f a ). a ∈ F( f a ), then the result is covered by Theorem 1.3. So we may assume that a ∈ J ( f a ). Likewise, Theorem 1.3 also applies when a is an escaping point of f a (as then a is either on a hair or an escaping endpoint), so we may assume a /

Sketch of proof. If
∈ I ( f a ). Even without knowing that there is a ray landing at a, we can still associate one or more external addresses s, and a kneading sequence K(s), to a as follows. In [34], the notion of the extended fibreY of such a parameter was defined. This setY is a closed subset of parameter space containing a finite (and non-zero) number of parameter rays, with associated exponentially bounded external addresses [34,Lem. 17]. All of these addresses share the same kneading sequence, which it hence makes sense to refer to as the kneading sequence K(a) of the parameter a. (See [35,App. A].) The theory of internal addresses allows us to translate the kneading sequence into information about the position of a in parameter space, and vice versa. In particular, the kneading sequence of a parameter a is periodic if and only if there is a hyperbolic component U in parameter space (i.e. an open connected region in which all parameters have an attracting periodic orbit) such that a cannot be separated from U by a pair of periodic parameter rays landing at a common point. As discussed in [29,Thm. 4], for any such parameter, there is a cycle of periodic points that are not landing points of periodic dynamic rays. Hence, the assumption that all periodic points of f a are repelling, and that each of these is the landing point of a periodic ray, implies that the kneading sequence K(a) is aperiodic. Now let S be the finite set of exponentially bounded addresses associated to a as above; let us assume first for simplicity that #S ≤ 2. In "nice" cases, we would expect the dynamical ray g s of f a , for s ∈ S, to land at the singular value a, but as discussed above this does not hold in general. However, the construction of fibres ensures that g s cannot be separated from a in a certain sense. More precisely, if two periodic or preperiodic dynamical rays land at a common point, let us call their union together with the landing point a "dynamical separation line". The singular value a cannot be separated from g s , for s ∈ S, by such a separation line.
Claim Any dynamic ray g s , where s is exponentially bounded and s / ∈ S, can be separated from a by a dynamical separation line. Moreover, the addresses of the rays in these separation lines are uniformly exponentially bounded (independently of s).
Proof Let S = {s − , s + }, with s − ≤ s + . Then the characteristic addresses (r j− , r j+ ) j≥1 of the hyperbolic components appearing in the internal address of a (see [35]) satisfy r j− < r ( j+1)− < s − ≤ s + < r ( j+1)+ < r j+ for all j, with r j− → s − and r j+ → s + . (Observe that we use the fact that the kneading sequence is aperiodic, and hence the internal address is infinite.) Furthermore, the rays at addresses r j− and r j+ have a common periodic landing point, and hence the corresponding separation line separates a from g s for all s / ∈ [s − , s + ]. Moreover, by the internal address algorithm, the kneading sequences of the addresses r j± are all exponentially bounded with the same bound as K(a), and hence the addresses involved are uniformly exponentially bounded. In particular, if s − = s + , then the claim is proved.
If s − < s + , so that #S = 2, we claim that there is also a sequence of preperiodic separation lines with associated external addresses {r j− ,r j+ } ⊂ (s − , s + ), converging to {s − , s + } from the inside. It is possible to deduce this using the methods of [35]. Instead, we notice that, in this case, the addresses in S must be bounded [35,Thm. A.3], and hence the claim reduces to the corresponding statement for unicritical polynomials, using the same reduction as in the proof of [35,Thm. A.3]. But in this setting, the claim is well known: for a unicritical polynomial without non-repelling cycles, the minor leaf of the corresponding lamination is approximated on from both sides by periodic or preperiodic leaves.
Observe that a separation line does not contain any escaping endpoints. Now suppose that t 1 and t 2 are exponentially bounded addresses whose itineraries (with respect to s ∈ S) are defined and do not coincide. Then it follows that g t 1 and g t 2 can be separated by a separation line. Indeed, suppose first that the initial itinerary entries differ, and consider a separation line γ that separates g σ (t 1 ) from a. Then the component of f −1 a (C\γ ) containing g t 1 can contain only rays whose initial itinerary entry agrees with that of t 1 . This implies that t 1 and t 2 are indeed separated. The case where the itineraries of t 1 and t 2 first differ in the nth entry, for n > 0, follows inductively by taking pullbacks. Given that any two escaping endpoints have different itineraries by Proposition 6.10, it follows again thatẼ( f a ) is totally separated.
If #S ≥ 3, the proof proceeds analogously, using separation lines lying in each of the complementary intervals of S. Alternatively, note that in this case the addresses in S are eventually periodic [35,Thm. A.3], and it follows from [4] that the singular value a is preperiodic. In this case, it is known that a is an endpoint [43,Thm. 4.3], and hence the result follows from Theorem 1.3.
Conjecturally, every repelling periodic point of an exponential map with nonescaping singular value is the landing point of a periodic dynamic ray. Hence, Theorem 8.1 provides strong evidence that Conjecture 1.6 is valid at least for all exponential maps without Cremer points or Siegel discs.
In addition, if f a has a Siegel disc whose boundary contains the singular value a, then conjecturally the singular value a is an endpoint. If this is the case, then the claim in Conjecture 1.6 holds for such parameters by Theorem 1.3. However, when f a has a Cremer point (or, indeed, a Siegel disc whose boundary does not contain the singular value), then in view of the results discussed above it is likely that a is not an endpoint.
More recent results on quadratic polynomials with Cremer fixed points (and Siegel discs) suggest that Conjecture 1.6 is true in these cases also. Indeed, for a large class of such maps, Shishikura has announced the existence of an arc in the Julia set connecting the fixed point and the critical point, and although the general case is out of reach, this is now widely believed to be true in general. For exponential maps with an irrationally indifferent orbit, it seems likely that there is similarly an arc of non-escaping points connecting the singular value to this orbit. We could then join this arc with one of its preimages to obtain a curve connecting the singular value to ∞, and apply the results of Sect. 6.
Finally, let us briefly remark that our results for the set of escaping endpoints (and all endpoints) leave open similar questions for the case of non-escaping endpoints, even for the case of e z − a with a > 1. Evdoridou [15] has recently announced a result that implies that the set of non-escaping points of the Fatou function z → z + 1 + e −z (whose Julia set is a Cantor bouquet), together with ∞, is totally separated. The proof can be adopted to show also that the set of non-escaping endpoints-and even the set of all endpoints not belonging to the fast escaping set A( f )-of an exponential map with Cantor bouquet Julia set has the same property. This shows that our results are optimal in a certain sense.