We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups.We compare characterizations of superrefiexivity in terms of diamond graphs and binary trees.We show that there exist sequences of series-parallel graphs of increasing topological complexitywhich admit uniformly bilipschitz embeddings into a Hilbert space, and thus do not characterize superrefiexivity.
We show that a geodesic metric space which does not admit bilipschitz embeddings into Banach spaces with the Radon-Nikodým property does not necessarily contain a bilipschitz image of a thick family of geodesics. This is done by showing that no thick family of geodesics is Markov convex, and comparing this result with results of Cheeger-Kleiner, Lee-Naor, and Li. The result contrasts with the earlier result of the author that any Banach space without the Radon-Nikodým property contains a bilipschitz...
The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.
Download Results (CSV)