Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dimension of the accumulation set of any hair for the exponential map

Published 17 Aug 2026 in math.DS | (2608.16445v1)

Abstract: We study the dynamics of the exponential map on the complex plane. The set Λ<em>cΛ<em>{\mathbf{c}} of all points sharing a given itinerary c\mathbf{c} is non-empty if and only if c\mathbf{c} is an exponentially bounded itinerary. For such itineraries, Λ</em>cΛ</em>{\mathbf{c}} also contains a curve of escaping points, and hence its Hausdorff dimension is at least~$1$. We prove that for every exponentially bounded itinerary this dimension is in fact equal to~$1$. In comparison, for certain itineraries, the set ΛcΛ_{\mathbf{c}} exhibits highly complicated topological structures, such as indecomposable continua.

Summary

  • The paper proves that every non-empty itinerary set Λ_c for fλ(z) of the exponential map e^z under the condition that “c” is exponentially bounded has a Hausdorff dimension of 1.
  • The proof defines three unique regions with a common proof strategy and requires stratify the points in each by a complex estimation of escape time
  • This key fact grows from enhanced techniques including derivative growth lemmas and adjustments for the excecution

The problem and its context

The paper studies the Hausdorff dimension of the sets Λc\Lambda_c of points sharing a prescribed itinerary under the exponential map fλ(z)=λezf_\lambda(z)=\lambda e^z. Partitioning the plane into horizontal strips Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}, each point zz is assigned an itinerary c=c0c1…c=c_0c_1\ldots recording the strip visited by each iterate. Devaney and Krych established that Λc≠∅\Lambda_c\neq\emptyset if and only if cc is exponentially bounded, and Schleicher and Zimmer later showed (with a parameter-independent definition of exponential boundedness) that for such itineraries Λc∞\Lambda_c^\infty contains an escaping curve — the tail of a hair — which Viana proved to be C∞C^\infty-smooth.

The topological structure of Λc\Lambda_c can be far more complicated than a single curve: Devaney and Jarque showed that for fλ(z)=λezf_\lambda(z)=\lambda e^z0 and bounded block-form itineraries with sufficiently long zero blocks, fλ(z)=λezf_\lambda(z)=\lambda e^z1 is an indecomposable continuum; related phenomena occur at Misiurewicz parameters such as fλ(z)=λezf_\lambda(z)=\lambda e^z2, and bounded indecomposable continua disjoint from the hair itself are also known. Since every non-empty fλ(z)=λezf_\lambda(z)=\lambda e^z3 contains a smooth curve, fλ(z)=λezf_\lambda(z)=\lambda e^z4 always holds. Zdunik and Pawelec had previously shown that for bounded itineraries this lower bound is sharp: fλ(z)=λezf_\lambda(z)=\lambda e^z5. The present work extends this to all exponentially bounded itineraries — including unbounded ones — showing that topological complexity never raises the Hausdorff dimension above one.

Main result

For fλ(z)=λezf_\lambda(z)=\lambda e^z6 and any itinerary fλ(z)=λezf_\lambda(z)=\lambda e^z7, the authors prove

fλ(z)=λezf_\lambda(z)=\lambda e^z8

which, combined with the existence of an escaping curve in every non-empty fλ(z)=λezf_\lambda(z)=\lambda e^z9, yields the corollary that Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}0 whenever Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}1 (equivalently, whenever Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}2 is exponentially bounded). This is a strong rigidity statement: even when Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}3 is an indecomposable continuum accumulating everywhere on itself, its Hausdorff dimension equals exactly one. The restriction to Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}4 is a deliberate simplification; the authors state that the techniques appear to extend to all real Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}5, but not to non-real parameters such as Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}6.

Proof strategy

The set Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}7 of points with bounded orbit consists of at most two points, so it suffices to cover the unbounded part. Fixing Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}8, the authors construct coverings Pk={z:(2k−1)π<Im⁡z⩽(2k+1)π}P_k=\{z:(2k-1)\pi<\operatorname{Im}z\leqslant(2k+1)\pi\}9 with mesh tending to zero and total zz0-weight uniformly bounded by zz1, giving zz2; letting zz3 concludes the argument. A key choice is to take the cutoff zz4 on the forward orbit of the singular value zz5, so that zz6, ensuring zz7.

The plane is split into three regions treated by distinct subfamilies:

  • Right half-plane (zz8): pull back rectangles from level zero via inverse branches; counting arguments give at most zz9 pieces per rectangle c=c0c1…c=c_0c_1\ldots0 with diameter c=c0c1…c=c_0c_1\ldots1, yielding weight c=c0c1…c=c_0c_1\ldots2 per rectangle.
  • Left half-plane (c=c0c1…c=c_0c_1\ldots3): orbits starting far left shadow the orbit of c=c0c1…c=c_0c_1\ldots4 until reaching roughly c=c0c1…c=c_0c_1\ldots5 (Lemma on escape from c=c0c1…c=c_0c_1\ldots6), so one iterates until the image has diameter at least c=c0c1…c=c_0c_1\ldots7 and pulls back elements of c=c0c1…c=c_0c_1\ldots8 using a branch of c=c0c1…c=c_0c_1\ldots9. Bounded distortion of Λc≠∅\Lambda_c\neq\emptyset0 follows from the Koebe Distortion Theorem, with distortion constant Λc≠∅\Lambda_c\neq\emptyset1 arbitrarily close to Λc≠∅\Lambda_c\neq\emptyset2 as Λc≠∅\Lambda_c\neq\emptyset3.
  • Middle strip (Λc≠∅\Lambda_c\neq\emptyset4): this requires entirely new techniques relative to [PZ]. Points are stratified by escape time Λc≠∅\Lambda_c\neq\emptyset5 into sets Λc≠∅\Lambda_c\neq\emptyset6, further split by sign (Λc≠∅\Lambda_c\neq\emptyset7) according to whether some iterate crosses the negative real axis — possible only once per piece, and then along a line segment interior to the piece. A derivative-growth lemma shows that for each point there exists Λc≠∅\Lambda_c\neq\emptyset8 with Λc≠∅\Lambda_c\neq\emptyset9 (with cc0), obtained by partitioning trajectories into sectors where the cumulative derivative grows geometrically, using explicit estimates near cc1 and distortion control further out.

Each subfamily contributes at most cc2 to the first-level sum, and an induction over levels transfers these bounds: the right-family estimate cc3 per rectangle is preserved, while left and middle families inherit their weights from pulled-back right-families at shifted itineraries, with the geometric factor cc4 controlling the middle sum. The authors emphasize careful tracking of constants throughout, noting the proof is more technical than the underlying idea warrants.

Limitations and open questions

The method is confined to real parameters: the authors explicitly note it does not work for cc5, notably cc6, where hairs accumulate on themselves through two distinct mechanisms. Although the authors expect the argument extends to all real cc7, this is asserted rather than carried out, and the extension would require re-verifying the delicate constant-dependent estimates. The full catalogue of topological types realized by cc8 across all parameters and itineraries also remains open, though the dimension result shows this classification cannot be detected by Hausdorff dimension.

Conclusion

The paper establishes that for the exponential map cc9, every non-empty itinerary set Λc∞\Lambda_c^\infty0 has Hausdorff dimension exactly one, regardless of whether it is a simple hair or an indecomposable continuum. The proof combines classical covering techniques for the outer half-planes with new escape-time stratification and derivative-growth estimates in the middle region, extending the earlier bounded-itinerary result of Zdunik and Pawelec to all exponentially bounded itineraries.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.