pith. sign in

arxiv: 1509.06437 · v1 · pith:K4JVYJPKnew · submitted 2015-09-22 · 🧮 math.GT · math.MG

Hyperbolic Dimension and Decomposition Complexity

classification 🧮 math.GT math.MG
keywords decompositioncomplexityfinitemetricdimensionhyperbolicprovespaces
0
0 comments X
read the original 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 spaces do not have finite decomposition complexity is also discussed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.