On constructions preserving the asymptotic topology of metric spaces
classification
🧮 math.GT
keywords
asymptoticconstructionsdranishnikovfiniteproductsboundedcliquecomplexity
read the original abstract
We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikov's property C, and Dranishnikov and Zarichnyi's straight finite decomposition complexity are preserved by constructions such as unions, free products, and group extensions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.