When is the Cuntz-Krieger algebra of a higher-rank graph approximately finite-dimensional? (Q435862)

\textit{A. Kumjian} and \textit{D. Pask} defined a higher-rank graph, or \(k\)-graph, \(\Lambda\), and under suitable conditions associated a C*-algebra \(C^*(\Lambda)\) to it, see [New York J. Math. 6, 1--20 (2000; Zbl 0946.46044)]. As it turned out, \(C^*\)-algebras of higher-rank graphs model lots of examples and provide a versatile tool for studying general properties of \(C^*\)-algebras. In the present paper the authors are concerned with finding necessary and sufficient conditions for a higher-rank graph \(C^*\)-algebra to be an AF algebra. The authors find that a necessary condition for a finitely aligned \(k\)-graph to have an AF algebra is the absence of so called generalised cycles. The definition is quite technical, but mimics the situation for graph algebras. The proof is divided into two parts, depending on whether there is a generalised cycle with an entrance, in which case the algebra contains an infinite projection, or whether a generalised cycle without entrance exists. In the latter case the key step in the proof is a modification of a result due to \textit{O. Bratteli, G. A. Elliott} and \textit{R. H. Herman}, [Commun. Math. Phys. 74, 281--295 (1980; Zbl 0437.46059)]. Further refined conditions ensuring that a higher-graph algebra is AF are determnined in terms of reduction to corners determines by vertices, and recipes for constructing AF higher-rank graph algebras are given. The best results, comprising both necessary and sufficient conditions, are given in the case of higher-rank graphs with finitely many vertices. The paper concludes with a large and informative section on examples, some of which illustrate open problems.