Quasiconformal uniformization and extension for planar trees

arXiv:2610.14236 · math.MG · Submitted 2026-10-09 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Quasiconformal uniformization and extension for planar trees".

Emmy: Here's the gist of the paper. Detailed Research Summary: Quasiconformal Uniformization and Extension for Planar Trees This research paper establishes a significant uniformization theorem analogous to Ahlfors' classical result for planar arcs, specifically addressing planar trees.

Ada: The core objective is to understand the geometric structure of quasiconformal trees, particularly those with uniform branch separation, and to provide extension properties for maps between them.

Emmy: Key Theoretical Framework and Uniformization: The paper leverages a series of constructive arguments involving combinatorial catalogs of quasi-self-similar fractals and associated trees to classify these objects.

Ada: A central result is Theorem 1.5, which states that if T is a planar quasiconformal tree with uniform branch separation, then for any epsilon > 0, there exists a quasiconformal map f: R squared to R squared such that the image f(T) is a semi-geodesic tree with Hausdorff dimension H f(T) < 1 + epsilon.

Paper summary: Ada: So we’ve touched on what this paper is about, which is tackling planar trees that are quasiconformal and have uniform branch separation. The main thrust of the paper, "Quasiconformal uniformization and extension for planar trees," is to establish a version of Ahlfors' classical result specifically tailored for these tree structures.

Emmy: They are proving that any such tree can be uniformly equivalent to a quasiconvex planar tree with a Hausdorff dimension very close to one. This uniformization is achieved by building up short catalogs of specific trees whose dimensions get closer and closer to one.

Kolya: From a research standpoint, this uniformization result is the foundation because it sets the geometric stage for the extension theorems they discuss later in the paper.

Ada: And that leads to a key conclusion: corollary one point six states that for any planar quasiconformal tree with uniform branch separation, its Quasiconformal Dimension is exactly one, which simplifies how we characterize these objects geometrically.

Emmy: Beyond just dimension, they give us powerful extension properties for maps between these trees that respect the orientation of the branches at every branch point. theorem one point eight says quasisymmetric maps extend to quasiconformal homeomorphisms of the plane.

Kolya: And they also have bounds on how much distortion is allowed for those extensions in theorem six point two, linking it back to properties like the bounded turning constant of the tree and your own mapping constants, eta or L.

Ada: So what this means for a listener is that we can take any complex-looking planar quasiconformal tree with uniform branch separation and know that it’s essentially just one of a very well-behaved family, allowing us to extend maps between them in a controlled way.

Emmy: And the authors then use these general results, like proposition four point one two, to show how they can actually construct specific examples, like the Vicsek fractal tree, which is the Julia set of a uniformly quasiregular map of R two by one.

Kolya: That application part shows that this theoretical framework isn't just abstract; it has concrete geometric consequences for specific fractal objects found in dynamical systems.

Conclusion: Ada: So wrapping up "Quasiconformal uniformization and extension for planar trees," the authors are essentially taking a deep structural understanding of these planar quasiconformal trees and connecting it to how maps behave on them. The main point is establishing that these trees have very controlled geometric properties, specifically having a dimension of one in the quasiconformal sense.

Emmy: They’ve shown that this uniformization allows for precise control over extending homeomorphisms, giving us explicit bounds on the necessary distortion when moving from one tree to another or extending a map to the plane.

Kolya: And they’ve shown that this theory is robust enough to apply to concrete examples, like the Julia sets of quadratic maps, proving that these complex dynamics can be understood through this tree structure.

Ada: The implication for the world is that it provides a rigorous way to classify and understand the geometry of fractal objects arising in complex systems by linking them back to these uniform planar trees.

Emmy: It means we have a solid toolbox for analyzing how maps behave on these structures, whether they are homeomorphisms or just quasisymmetric maps, providing concrete quantitative limits on distortion.

Kolya: The limitation they point out is that the uniformization part relies on having uniform branch separation, which is a condition you have to meet first; if that’s not there, the whole structure doesn't fit this specific theorem.

Ada: So in simple terms, this paper gives us a very precise map for understanding how complex fractal trees behave under maps and how they can be stretched without losing their essential geometric character.

FOTIS IOANNIDIS, VYRON VELLIS

math.MG

Submitted: 2026-10-09

Updated: 2026-10-30

Comments: 72 pages, 14 figures

License: http://creativecommons.org/publicdomain/zero/1.0/

Importance score: 86/100

The gist: Quasiconformal Uniformization and Extension for Planar Trees This research paper establishes a significant uniformization theorem analogous to Ahlfors' classical result for planar arcs…

Key concepts

Quasiconformal Tree
These are planar trees where each edge is mapped by a quasiconformal map. The paper focuses on trees with uniform branch separation, meaning branches are spaced consistently, allowing for precise geometric classification and uniformization.
Quasiconformal Dimension (GQC2dim)
This is a measure of the complexity or dimension of a planar quasiconformal tree. The key result shows that for trees with uniform branch separation, this dimension is exactly 1, indicating they are geometrically constrained.
Extension Properties
These theorems describe how maps defined on the tree can be extended to maps on the entire plane. Specifically, quasisymmetric or bi-Lipschitz functions on the tree extend to quasiconformal or bi-Lipschitz homeomorphisms of the plane, with distortion bounds depending on the tree's properties.

Terminology

Summary

Quasiconformal Uniformization and Extension for Planar Trees

This research paper establishes a significant uniformization theorem analogous to Ahlfors' classical result for planar arcs, specifically addressing planar trees. The core objective is to understand the geometric structure of quasiconformal trees, particularly those with uniform branch separation, and to provide extension properties for maps between them. p. 3

Where the paper says it

If T ⊂ R 2 is a quasiconformal tree with uniform branch separation, then GQC2dim(T) = 1. Extension properties of planar trees.

Key Theoretical Framework and Uniformization:

The paper leverages a series of constructive arguments involving combinatorial catalogs of quasi-self-similar fractals and associated trees to classify these objects. A central result is Theorem 1.5, which states that if T is a planar quasiconformal tree with uniform branch separation, then for any epsilon > 0, there exists a quasiconformal map f: R squared to R squared such that the image f(T) is a semi-geodesic tree with Hausdorff dimension H f(T) < 1 + epsilon. Furthermore, Corollary 1.6 asserts that for any planar quasiconformal tree T with uniform branch separation, its Quasiconformal Dimension (GQC2dim) is exactly 1.

The construction of this uniformization relies on building a short catalog of planar quasiconvex trees whose Hausdorff dimensions are arbitrarily close to 1, which collectively serve to uniformize all planar quasiconformal trees possessing the specified uniform branch separation condition. p. 5

Where the paper says it

5 involves building a short catalog of planar quasiconvex trees of Hausdorff dimensions arbitrarily close to 1 that uniformizes all planar quasiconformal trees with uniform branch separation. For simplicity, we describe the construction for trees of valence at most 4.

Extension Properties for Homeomorphisms:

The paper provides powerful extension theorems concerning homeomorphisms between planar quasiconformal trees that respect the counterclockwise orientation of branches at every branch point. Theorem 1.8 details these properties:

  1. If a map f: T to R squared is quasisymmetric, it extends to a quasiconformal orientation-preserving homeomorphism F: R squared to R squared. p. 6

    Where the paper says it

    12 that each element in Tm is a quasiconvex tree of uniform branch separation. Conversely, we also show that if T is a planar quasiconformal tree with uniform branch separation and valence at most m, then there exists a semi-geodesic T ′ ∈ Tm and a quasisymmetric branch-orientation-preserving homeomorphism f ∶ T → T ′ .

  2. If f is bi-Lipschitz, it extends to a bi-Lipschitz orientation-preserving homeomorphism F: R squared to R squared. p. 4

    Where the paper says it

    (2) If f is bi-Lipschitz, then there exists a bi-Lipschitz orientation preserving extension F ∶ R 2 → R 2 . Conversely, if F ∶ R 2 → R 2 is an orientation preserving homeomorphism and if T ⊂ R 2 is a tree, then F∣T is branch-orientation-preserving.

A quantitative refinement of these extension properties is provided by Theorem 6.2. This theorem offers explicit bounds on the distortion required for extension:

  1. If g is eta-quasisymmetric, it extends to a K-quasiconformal homeomorphism F: R squared to R squared, where the constant K depends only on the bounded turning constant of T and eta. p. 4

    Where the paper says it

    8 is quantitative in the sense that the quasiconformality (resp. biLipschitz) constant of F depends only on the bounded turning constant of T, and on the distortion function (resp.

  2. If g is L-bi-Lipschitz, it extends to an L' -bi-Lipschitz homeomorphism F: R squared to R squared, where the constant L' depends only on the bounded turning constant of T and on L.

Classification and Combinatorial Tools:

The paper introduces tools for classifying trees. Proposition 4. p. 6

Where the paper says it

Similarly, one builds Tm for any m ≥ 2. We show in Proposition 4.

12 demonstrates that if a set W is an m-dictionary, then the tree formed by applying this dictionary to T, denoted TW, is a cm-quasiconvex tree exhibiting Cm-uniform branch separation, with a Hausdorff dimension at most 1+ epsilon. Crucially, it further proves that for any planar quasiconformal tree T with uniform branch separation and valence at most m, there exists an m-dictionary W and a theta-quasisymmetric, branch-orientation-preserving homeomorphism g: T to TW such that the resulting tree TW is semi-geodesic. p. 6
Where the paper says it

12 that each element in Tm is a quasiconvex tree of uniform branch separation. Conversely, we also show that if T is a planar quasiconformal tree with uniform branch separation and valence at most m, then there exists a semi-geodesic T ′ ∈ Tm and a quasisymmetric branch-orientation-preserving homeomorphism f ∶ T → T ′ .

Application to Julia Sets (Specific Example):

The paper applies these general results to the Julia set J(f) of quadratic maps, specifically f(z) = z squared + c where the critical point 0 is preperiodic. It establishes that for such maps, J(f) is a tree and proves it possesses the structure of a quadrivalent quasiconformal tree with branch set B(J(f)) = n in N 0 f-n(0). p. 0

Where the paper says it

bi-Lipschitz) to the whole plane. As a corollary of the extension theorem we construct a large class of quadrivalent quasiconformal trees, which includes the Vicsek fractal, so that each tree in this class is the Julia set of a uniformly quasiregular map of R 2 .

The construction of this result involves:

  1. Showing that the Vicsek tree V is quasiconformally equivalent to a specific model T 4 (Proposition 7. p. 0

    Where the paper says it

    A classical uniformization theorem of Ahlfors [Ahl63] asserts that every bounded turning planar arc is the image of the unit segment under a quasiconformal self-map of the plane. We prove an analogous uniformization theorem for planar trees by showing that every planar quasiconformal tree with uniform branch separation is quasiconformally equivalent to a quasiconvex planar tree with uniform branch separation and Hausdorff dimension arbitrarily close to 1.

    3), which itself is characterized by a sequence of finite covers (X n) satisfying properties (1)–(8) of Proposition 7. p. 0
    Where the paper says it

    Roughly speaking, a homeomorphism of R 2 is quasiconformal if it maps infinitesimal disks to infinitesimal ellipses of bounded eccentricity. While quasiconformal maps are not C 1 , they preserve many geometric properties, so any set which is globally quasiconformally homeomorphic to a convex set must itself possess some nice geometry.

    1.

  2. Demonstrating that the Julia set J(f) can be subdivided into such a structure (X n), allowing the application of Proposition 8. p. 4

    Where the paper says it

    As an application of Theorem 1. 8, we show that the Vicsek tree V, one of the most well-known quasiconformal trees, is a Julia set of a UQR map.

    1, which guarantees the existence of a K-quasiconformal map F such that F(T) is a semi-geodesic tree with controlled dimension. p. 2
    Where the paper says it

    3 requires overcoming two major challenges, both having to do with how one constructs T ′ . The result of Bonk and Meyer [BM20] guarantees the existence of an abstract geodesic tree T ′′ that is quasisymmetric to T, but whether T ′′ (or any doubling geodesic tree) can be quasisymmetrically embedded in R 2 is the context of an open question of Bonk and Meyer [BM20, Section 10].

In summary, the paper provides a deep structural understanding of planar quasiconformal trees by linking uniformization theorems, precise extension bounds for homeomorphisms, and combinatorial characterizations. p. 0

Where the paper says it

QUASICONFORMAL UNIFORMIZATION AND EXTENSION FOR PLANAR TREES FOTIS IOANNIDIS AND VYRON VELLIS Abstract. A classical uniformization theorem of Ahlfors [Ahl63] asserts that every bounded turning planar arc is the image of the unit segment under a quasiconformal self-map of the plane.

This framework is then successfully deployed to rigorously characterize the geometry of Julia sets for quadratic polynomials as specific examples of quadrivalent quasiconformal trees. p. 0
Where the paper says it

bi-Lipschitz) to the whole plane. As a corollary of the extension theorem we construct a large class of quadrivalent quasiconformal trees, which includes the Vicsek fractal, so that each tree in this class is the Julia set of a uniformly quasiregular map of R 2 .

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved geometric understanding of complex dynamics via quasiconformal uniformization: The system can determine if a Julia set is a quasiconformal tree by checking its properties against known classes of trees, such as those in the Vicsek fractal class, which are explicitly shown to be Julia sets of uniformly quasiregular maps.

  2. Enhanced analysis of fractal boundary extensions: The AI can extend branch-orientation-preserving homeomorphisms from planar quasiconformal trees to the entire plane, providing a method to resolve topological obstacles like those seen in the difference between trees T1 and T2, which are homeomorphic but not ambiently homeomorphic.

  3. Classification of tree structures via tile decompositions: The system can classify planar quasiconformal trees with uniform branch separation and valence at most m by finding an m-dictionary W, effectively using the set W to characterize these trees as quasi-self-similar fractals T W.

  4. Quantitative approximation of complex geometric objects: The AI can construct a semi-geodesic tree T' that is quasiconformally equivalent to a given planar quasiconformal tree with uniform branch separation, providing an approximation where the Hausdorff dimension is arbitrarily close to 1 (Theorem 1.5).

  5. Robust analysis of embedding distortion: The system can quantify the distortion of branch-orientation-preserving embeddings between planar quasiconformal trees by showing that the extension map F is either K-quasiconformal or L'-bi-Lipschitz, with constants depending only on the bounded turning constant and the embedding distortion function.

  6. Automated construction of self-similar tree attractors: The system can construct a specific type of tree attractor T A∗ m using an m-dictionary W, which is shown to be a quasiconvex tree with uniform branch separation and valence at most m, providing a concrete model for these structures.

Abstract

A quasiconformal uniformization theorem of Rickman from 1966 asserts that every bounded turning planar arc is the image of the unit segment under a quasiconformal self-map of the plane. We prove an analogous uniformization theorem for planar trees by showing that every planar quasiconformal tree with uniform branch separation is quasiconformally equivalent to a quasiconvex planar tree with uniform branch separation and Hausdorff dimension arbitrarily close to 1. Along the way, we show that every quasisymmetric (resp. bi-Lipschitz) homeomorphism between planar quasiconformal trees that respects the counterclockwise orientation of the branches at every branch point can be extended quasisymmetrically (resp. bi-Lipschitz) to the whole plane. As a corollary of the extension theorem we construct a class of quadrivalent quasiconformal trees, which includes the Vicsek fractal, so that each tree in this class is the Julia set of a uniformly quasiregular map of R squared.

Related papers