2000 character limit reached
Decomposition complexity with respect to coarse properties
Published 1 Nov 2016 in math.MG and math.GT | (1611.00265v3)
Abstract: We formalize the concept of a family of metric spaces satisfying a coarse property uniformly and we generalize finite decomposition complexity of Erik Guentner, Romain Tessera, and Guoliang Yu. Of particular interest are results determining sufficient conditions for a metric space to satisfy Property A of Guoliang Yu.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.