A dichotomy for simple self-similar graph C^ -algebras

From MaRDI portal
Publication:2227581




Abstract: We investigate the pure infiniteness and stable finiteness of the Exel-Pardo C-algebras mathcalOG,E for countable self-similar graphs (G,E,varphi). In particular, we associate a specific ordinary graph widetildeE to (G,E,varphi) such that some properties such as simpleness, stable finiteness or pure infiniteness of the graph C-algebra C(widetildeE) imply that of mathcalOG,E. Among others, this follows a dichotomy for simple mathcalOG,E: if (G,E,varphi) contains no G-circuits, then mathcalOG,E is stably finite; otherwise, mathcalOG,E is purely infinite. Furthermore, Li and Yang recently introduced self-similar k-graph C-algebras mathcalOG,Lambda. We also show that when |Lambda0|<infty and mathcalOG,Lambda is simple, then it is purely infinite.









This page was built for publication: A dichotomy for simple self-similar graph \(C^\ast \)-algebras

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