Regular Finite Decomposition Complexity

DOI10.1142/S1793525319500286MaRDI QIDQ6276560arXivFDO

Authors Daniel Kasprowski, Andrew Nicas, David Rosenthal

Publication date 16 August 2016

Published in arXiv

Full work available at URL https://doi.org/10.1142/S1793525319500286

Mathematics Subject Classification ID

Geometric group theory (20F65) Asymptotic properties of groups (20F69)

arXiv classification

math.ATmath.GTmath.KTmath.MG

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.

This page was built for publication: Regular Finite Decomposition Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6276560)