Ostrovska, SofiyaLeung, Siu LamNelson, SarahOstrovska, SofiyaOstrovskii, MikhailMathematics2024-07-052024-07-05201820002-99391088-682610.1090/proc/137502-s2.0-85037566403https://doi.org/10.1090/proc/13750https://hdl.handle.net/20.500.14411/2967Nelson, Sarah B./0000-0001-5535-5755Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other; for example superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009). In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. This question was answered in the negative by Ostrovskii (2014), who left it open to determine the order of growth of the distortions. The main purpose of this paper is to get a sharp up-to-a-logarithmic-factor estimate for the distortions of embeddings of binary trees into diamond graphs and, more generally, into diamond graphs of any finite branching k >= 2. Estimates for distortions of embeddings of diamonds into infinitely branching diamonds are also obtained.eninfo:eu-repo/semantics/openAccessBinary treediamond graphdistortion of a bilipschitz embeddingLipschitz mapArticleQ21462695704WOS:000416972600020