arXiv · 1608.04516
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 containing all metric families with finite asymptotic dimension all other permanence properties follow from Fibering Permanence.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Daniel Kasprowski, Andrew Nicas, David Rosenthal. 2017-12-14. Regular Finite Decomposition Complexity. https://doi.org/10.1142/s1793525319500286
Cite the original work for its findings. Save a collection to share your selection of sources.