On the geometry of the countably branching diamond graphs (Q2402681)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the geometry of the countably branching diamond graphs
scientific article

    Statements

    On the geometry of the countably branching diamond graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 September 2017
    0 references
    Many important properties of Banach spaces can be characterized in terms of bilipschitz embeddability of metric spaces into them. The reviewer [Houston J. Math. 39, No. 3, 889--906 (2013; Zbl 1319.46017)] introduced the term test-spaces for metric spaces used in characterizations of this type. The most relevant in the context of the paper under review are the following three test-space characterizations of superreflexivity: (1) in terms of finite binary trees by \textit{J. Bourgain} [Isr. J. Math. 56, 222--230 (1986; Zbl 0643.46013)]; (2) in terms of diamond graphs and Laakso graphs by \textit{W. B. Johnson} and \textit{G. Schechtman} [J. Topol. Anal. 1, No. 2, 177--189 (2009; Zbl 1183.46022)]; (3) in terms of diamond graphs and Laakso graphs of high branching by \textit{M. I. Ostrovskii} and \textit{B. Randrianantoanina} [J. Funct. Anal. 273, No. 2, 598--651 (2017; Zbl 1373.46015)]. The authors continue the study of similar problems for non-local properties initiated by \textit{F. Baudier} et al. [Stud. Math. 199, No. 1, 73--94 (2010; Zbl 1210.46017)]. The main goal of the paper under review is to analyze the case of infinitely branching diamonds. The authors prove that in the non-local case trees and diamonds characterize different classes of Banach spaces and establish connections between embeddability of infinitely branching diamonds and some geometric properties of Banach spaces. The following result can be obtained by combining some of the results of this paper (see Corollary 5.3): Let \(Y\) be a reflexive Banach space with an unconditional asymptotic structure. Then, \(Y\) is asymptotically uniformly convexifiable if and only if countably branching diamonds of all depths admit embeddings into \(Y\) with uniformly bounded distortions. The paper contains many other results; the only goal of my review is to describe the direction of this very interesting research.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate metric midpoint
    0 references
    distortion of a bilipschitz embedding
    0 references
    Ribe program
    0 references
    countably branching diamond graphs
    0 references
    asymptotic uniform convexity
    0 references
    metric characterization
    0 references
    unconditional asymptotic structure
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references