skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Uniformly branching trees
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.  more » « less
Award ID(s):
2054987
PAR ID:
10347066
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Transactions of the American Mathematical Society
Volume:
375
Issue:
6
ISSN:
0002-9947
Page Range / eLocation ID:
3841-3897
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. 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. In this paper we show that every quasiconformal tree bi-Lipschitz embeds in some Euclidean space, with the ambient dimension and the bi-Lipschitz constant depending only on the doubling and bounded turning constants of the tree. This answers Question 1.6 of David and Vellis [Illinois J. Math. 66 (2022), pp. 189–244]. 
    more » « less
  2. In this note we provide a quasisymmetric taming of uniformly perfect and uniformly disconnected sets that generalizes a result of MacManus [Rev. Mat. Iberoamericana 15 (1999), pp. 267–277] from 2 to higher dimensions. In particular, we show that a compact subset of R n \mathbb {R}^n is uniformly perfect and uniformly disconnected if and only if it is ambiently quasiconformal to the standard Cantor set C \mathcal {C} in R n + 1 \mathbb {R}^{n+1} . 
    more » « less
  3. We prove that any metric surface (that is, metric space homeomorphic to a 2-manifold with boundary) with locally finite Hausdorff 2-measure is the Gromov–Hausdorff limit of polyhedral surfaces with controlled geometry. We use this result, together with the classical uniformization theorem, to prove that any metric surface homeomorphic to the 2-sphere with finite Hausdorff 2-measure admits a weakly quasiconformal parametrization by the Riemann sphere, answering a question of Rajala–Wenger. These results have been previously established by the authors under the assumption that the metric surface carries a length metric. As a corollary, we obtain new proofs of the uniformization theorems of Bonk–Kleiner for quasispheres and of Rajala for reciprocal surfaces. Another corollary is a simplification of the definition of a reciprocal surface, which answers a question of Rajala concerning minimal hypotheses under which a metric surface is quasiconformally equivalent to a Euclidean domain. 
    more » « less
  4. The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $$\unicode[STIX]{x1D707}$$ on the full $$d$$ -ary tree of height $$n$$ . If $$\unicode[STIX]{x1D707}=\unicode[STIX]{x1D6FA}(d^{2})$$ , all of the vertices are visited in time $$\unicode[STIX]{x1D6E9}(n\log n)$$ with high probability. Conversely, if $$\unicode[STIX]{x1D707}=O(d)$$ the cover time is $$\exp (\unicode[STIX]{x1D6E9}(\sqrt{n}))$$ with high probability. 
    more » « less
  5. In this paper we present new proofs of the non-embeddability of countably branching trees into Banach spaces satisfying property beta_p and of countably branching diamonds into Banach spaces which are l_p-asymptotic midpoint uniformly convex (p-AMUC) for p>1. These proofs are entirely metric in nature and are inspired by previous work of Jiří Matoušek. In addition, using this metric method, we succeed in extending these results to metric spaces satisfying certain embedding obstruction inequalities. Finally, we give Tessera-type lower bounds on the compression for a class of Lipschitz embeddings of the countably branching trees into Banach spaces containing l_p-asymptotic models for p>=1. 
    more » « less