pith. sign in

arxiv: 1301.3484 · v3 · pith:XR643PSVnew · submitted 2013-01-15 · 🧮 math.MG · math.GN

Asymptotic dimension, decomposition complexity, and Haver's property C

classification 🧮 math.MG math.GN
keywords complexitydecompositionpropertyasymptoticcomparedimensiongamehaver
0
0 comments X
read the original abstract

The notion of the decomposition complexity was introduced in \cite{GTY} using a game theoretical approach. We introduce a notion of straight decomposition complexity and compare it with the original as well with the asymptotic property C. Then we define a game theoretical analog of Haver's property C in the classical dimension theory and compare it with the original.

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.