A dichotomy for simple self-similar graph -algebras
arXiv:2005.05543
Abstract
We investigate the pure infiniteness and stable finiteness of the Exel-Pardo -algebras for countable self-similar graphs . In particular, we associate a specific ordinary graph to such that some properties such as simpleness, stable finiteness or pure infiniteness of the graph -algebra imply that of . Among others, this follows a dichotomy for simple : if contains no -circuits, then is stably finite; otherwise, is purely infinite. Furthermore, Li and Yang recently introduced self-similar -graph -algebras . We also show that when and is simple, then it is purely infinite.
17 pages