Experts has a new look! Let us know what you think of the updates.

Provide feedback
Home
Scholarly Works
Regular finite decomposition complexity
Journal article

Regular finite decomposition complexity

Abstract

We introduce the notion of regular finite decomposition complexity of a metric family. This generalizes Gromov’s finite asymptotic dimension and is motivated by the concept of finite decomposition complexity (FDC) due to Guentner, Tessera and Yu. Regular finite decomposition complexity implies FDC and has all the permanence properties that are known for FDC, as well as a new one called Finite Quotient Permanence. We show that for a collection …

Authors

Kasprowski D; Nicas A; Rosenthal D

Journal

Journal of Topology and Analysis, Vol. 11, No. 03, pp. 691–719

Publisher

World Scientific Publishing

Publication Date

September 2019

DOI

10.1142/s1793525319500286

ISSN

1793-5253