On embedding trees into uniformly convex Banach spaces

From MaRDI portal
Publication:1969001

DOI10.1007/BF02785579zbMath0948.46011OpenAlexW1981853164MaRDI QIDQ1969001

Ji{ří} Matoušek

Publication date: 19 November 2000

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02785579



Related Items

Bi-Lipschitz embeddings of quasiconformal trees, Metric Characterizations of Some Classes of Banach Spaces, Data center interconnection networks are not hyperbolic, Metric Embedding via Shortest Path Decompositions, Routing and scheduling for energy and delay minimization in the powerdown model, Bandwidth and low dimensional embedding, Dimension reduction for finite trees in \(\ell_1\), Old and new challenges in Hadamard spaces, An introduction to the Ribe program, Approximating spaces of Nagata dimension zero by weighted trees, Umbel convexity and the geometry of trees, Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs, Advances in metric embedding theory, Embedding metric spaces into normed spaces and estimates of metric capacity, The mixed Lipschitz space and its dual for tree metrics, On the advice complexity of the \(k\)-server problem under sparse metrics, Markov convexity and nonembeddability of the Heisenberg group, Connected graph searching, A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces, Quantitative geometry, Heat flow and quantitative differentiation, On dominated \(\ell_1\) metrics, Yet another short proof of Bourgain's distortion estimate for embedding of trees into uniformly convex Banach spaces, (β)-distortion of some infinite graphs, Counting distance permutations, Bandwidth and Low Dimensional Embedding, Quantitative affine approximation for UMD targets, A characterization of superreflexivity through embeddings of lamplighter groups, Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders, Unnamed Item, On online algorithms with advice for the \(k\)-server problem



Cites Work