Decomposition complexity growth of finitely generated groups

Abstract

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic dimension. In this paper, we introduce the notion of decomposition complexity growth, which is a quasi-isometry invariant generalizing both finite decomposition complexity and dimension growth. We show that subexponential decomposition complexity growth implies property A, and is preserved by certain group and metric constructions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…