{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q643565","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q643565","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q643565","kernelVersion":"v1","immutable":true,"modified":"2026-03-26T17:18:41Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q643565","name":"On simple labelled graph \\(C^{*}\\)-algebras","headline":"On simple labelled graph \\(C^{*}\\)-algebras","description":"scientific article; zbMATH DE number 5966289","url":"https://portal.mardi4nfdi.de/entity/Q643565","datePublished":"2011-11-02","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q477051"},{"@id":"https://portal.mardi4nfdi.de/entity/Q321784"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q85344"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.JMAA.2011.08.018","url":"https://doi.org/10.1016/J.JMAA.2011.08.018"},"sameAs":["https://doi.org/10.1016/J.JMAA.2011.08.018"],"comment":"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}.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1397191"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1585653"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2902932"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1139784"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1127812"},{"@id":"https://portal.mardi4nfdi.de/entity/Q676206"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4681774"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3155765"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3372173"}]},"provenance":{"prov:generatedAtTime":"2026-03-26T17:18:41Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}