2 results
Search Results
Now showing 1 - 2 of 2
Article Citation - WoS: 15Citation - Scopus: 14Generalized Transportation Cost Spaces(Springer Basel Ag, 2019) Ostrovska, Sofiya; Ostrovskii, Mikhail I.The paper is devoted to the geometry of transportation cost spaces and their generalizations introduced by Melleray et al. (Fundam Math 199(2):177-194, 2008). Transportation cost spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein 1 spaces. In this work, the existence of metric spaces with the following properties is proved: (1) uniformly discrete metric spaces such that transportation cost spaces on them do not contain isometric copies of l(1), this result answers a question raised by Cuth and Johanis (Proc Am Math Soc 145(8):3409-3421, 2017); (2) locally finite metric spaces which admit isometric embeddings only into Banach spaces containing isometric copies of l(1); (3) metric spaces for which the double-point norm is not a norm. In addition, it is proved that the double-point norm spaces corresponding to trees are close to l(infinity)(d) of the corresponding dimension, and that for all finite metric spaces M, except a very special class, the infimum of all seminorms for which the embedding of M into the corresponding seminormed space is isometric, is not a seminorm.Article Citation - WoS: 2Citation - Scopus: 2Distortion of Embeddings of Binary Trees Into Diamond Graphs(Amer Mathematical Soc, 2018) Leung, Siu Lam; Nelson, Sarah; Ostrovska, Sofiya; Ostrovskii, MikhailDiamond 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.
