2016
DOI: 10.1112/jlms/jdv074
|View full text |Cite
|
Sign up to set email alerts
|

(β)-distortion of some infinite graphs

Abstract: Abstract. A distortion lower bound of Ω(log(h) 1/p ) is proven for embedding the complete countably branching hyperbolic tree of height h into a Banach space admitting an equivalent norm satisfying property (β) of Rolewicz with modulus of power type p ∈ (1, ∞) (in short property (βp)). Also it is shown that a distortion lower bound of Ω(ℓ 1/p ) is incurred when embedding the parasol graph with ℓ levels into a Banach space with an equivalent norm with property (βp). The tightness of the lower bound for trees is… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
15
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 27 publications
0
15
0
Order By: Relevance
“…Let Y be a Banach space with an asymptotically midpoint uniformly convex norm. The argument is similar to the proof of Proposition 2.1 in [5] and the formal argument using set-theoretic representations of the graphs shall be simply sketched. Let f k be a bi-Lipschitz embedding of G ω k into Y that is non-contracting and C-Lipschitz.…”
Section: Non-embeddability Of the Countably Branching Diamond Graphsmentioning
confidence: 90%
“…Let Y be a Banach space with an asymptotically midpoint uniformly convex norm. The argument is similar to the proof of Proposition 2.1 in [5] and the formal argument using set-theoretic representations of the graphs shall be simply sketched. Let f k be a bi-Lipschitz embedding of G ω k into Y that is non-contracting and C-Lipschitz.…”
Section: Non-embeddability Of the Countably Branching Diamond Graphsmentioning
confidence: 90%
“…The following argument is a modification of the elegant argument of Baudier and Zheng [1], which is itself a modification of Kloeckner's argument [13] for the non-embeddability of binary trees into uniformly convex spaces. By Lemma 3.3 and the choice of y * * , there exists y * * 0 ∈ s 2 n −l 4ε (A * * B X * * ) ∩ V and y * ∈ B Y * ∩ U such that Re y * * 0 (y * ) > ε − δ.…”
Section: Property (β) and Non-linear Characterizationsmentioning
confidence: 99%
“…If p = ∞, we replace the ℓ p direct sum with the c 0 direct sum. Then S 1 ∞ n=1 ε n , S 3 2 ∞ n=1 ε n , and…”
mentioning
confidence: 99%