Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 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

Bi-Lipschitz geometry of quasiconformal trees (2007.12297v3)

Published 23 Jul 2020 in math.MG

Abstract: A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a catalog of metric trees in a purely combinatorial way, and show that every quasiconformal tree is bi-Lipschitz equivalent to one of the trees in our catalog. This is inspired by results of Herron-Meyer and Rohde for quasi-arcs. Second, we show that a quasiconformal tree bi-Lipschitz embeds in a Euclidean space if and only if its set of leaves admits such an embedding. In particular, all quasi-arcs bi-Lipschitz embed into some Euclidean space.

Summary

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