On simple labelled graph \(C^{*}\)-algebras (Q643565)

A \textit{labelled graph} is a pair \((E,\mathcal L)\), where \(E\) is a directed graph and \(\mathcal L\) is a map from \(E^1\) (the set of arrows of \(E\)) to a countable alphabet \(\mathcal A\). A \textit{labelled space} is a triple \((E, \mathcal L, \mathcal B)\), where \((E,\mathcal L)\) is a labelled graph and \(\mathcal B\) is an \textit{accommodating set}, which is a certain subset of \(2^{E^0}\) closed under suitable operations. \textit{T. Bates} and \textit{D. Pask} introduced in [``\(C^*\)-algebras of labelled graphs'', J. Oper. Theory 57, No. 1, 207--226 (2007; Zbl 1113.46049)] the concept of the graph \(C^{*}\)-algebra \(C^*(E,\mathcal L, \mathcal B)\) of a labelled space \((E,\mathcal L, \mathcal B)\). In the present paper, the authors study the simplicity of the graph \(C^{*}\)-algebras \(C^*(E,\mathcal L,\mathcal E)\), where \(\mathcal E\) is either the smallest accommodating set \(\mathcal E ^{0,-}\) or the smallest accommodating set containing all the generalized vertices \(\overline{\mathcal E}\). Under suitable hypotheses, they find a characterization of simplicity for these \(C^{*}\)-algebras. Part of their work is based on the article [``\(C^{*}\)-algebras of labelled graphs. II. Simplicity results.'', Math. Scand. 104, No. 2, 249--274 (2009; Zbl 1247.46046)] by \textit{T. Bates} and \textit{D. Pask}.