On embedding trees into uniformly convex Banach spaces (Q1969001): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 06:24, 5 March 2024

scientific article
Language Label Description Also known as
English
On embedding trees into uniformly convex Banach spaces
scientific article

    Statements

    On embedding trees into uniformly convex Banach spaces (English)
    0 references
    0 references
    19 November 2000
    0 references
    The author deals with an investigation into the minimum value of \(D= D(n)\) such that any \(n\)-point tree metric space \((T,\rho)\) can be \(D\)-embedded into a given Banach space \((X,\|\cdot\|)\); i.e., there exists a mapping \(f: T\to X\) such that \(D^{-1}\rho(x,y)\leq\|f(x)- f(y)\|\leq \rho(x,y)\) for all \(x,y\in T\). Bourgain showed that \(X\) is super reflexive if and only if \(D(n)\to \infty\) as \(n\to\infty\). For \(X= \ell^p\), \(1< p<\infty\) he gave a lower bound \(\log D(n)\geq\text{const}+ \min\left({1\over 2},{1\over p}\right)\cdot\log(\log\log n)\). The present author presents among other things a more elementary proof of this lower bound and shows that it's tight (up to a multiplicative constant). For Euclidean spaces with no restriction on the dimension \(D(n)= O(\sqrt{\log\log n})\) holds.
    0 references
    0 references
    embedding trees into uniformly convex Banach spaces
    0 references
    \(n\)-point tree metric space
    0 references
    super reflexive
    0 references
    0 references