Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Uniformly branching trees (2004.07912v1)

Published 16 Apr 2020 in math.CV, math.DS, and math.GT

Abstract: A quasiconformal tree $T$ is a (compact) metric tree that is doubling and of bounded turning. We call $T$ trivalent if every branch point of $T$ has exactly three branches. If the set of branch points is uniformly relatively separated and uniformly relatively dense, we say that $T$ is uniformly branching. We prove that a metric space $T$ is quasisymmetrically equivalent to the continuum self-similar tree if and only if it is a trivalent quasiconformal tree that is uniformly branching. In particular, any two trees of this type are quasisymmetrically equivalent.

Summary

We haven't generated a summary for this paper yet.