2015
DOI: 10.48550/arxiv.1509.06437
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Hyperbolic Dimension and Decomposition Complexity

Abstract: The aim of this paper is to provide some new tools to aid the study of decomposition complexity, a notion introduced by Guentner, Tessera and Yu. In this paper, three equivalent definitions for decomposition complexity are established. We prove that metric spaces with finite hyperbolic dimension have finite (weak) decomposition complexity, and we prove that the collection of metric families that are coarsely embeddable into Hilbert space is closed under decomposition. A method for showing that certain metric s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…We conclude this section by stating three alternative definitions (established in [NR18]) for a metric family X to be n-decomposable over a collection of metric families C. Condition (C) is a key technical tool needed for the proofs of Theorems 3.7, 3.9 and 3.10.…”
Section: Decomposition Over a Collection Of Metric Familiesmentioning
confidence: 99%
“…We conclude this section by stating three alternative definitions (established in [NR18]) for a metric family X to be n-decomposable over a collection of metric families C. Condition (C) is a key technical tool needed for the proofs of Theorems 3.7, 3.9 and 3.10.…”
Section: Decomposition Over a Collection Of Metric Familiesmentioning
confidence: 99%