A note on the simplicity of C*-algebras of edge-colored graphs
Keywords:
Edge-colored graph C*-algebras, amalgamated free product, simplicity.Abstract
We modify the definitions of hereditary and saturated subsets and Condition (L) for edge-colored graphs. We then give three necessary conditions for the simplicity of C*-algebras of edge-colored graphsReferences
AnHuef, A. Raeburn, I. 1997. The ideal structure of Cuntz-Krieger algebras.Ergodic Theory and Dynamical Systems. 17: 611-624.
Bates, T., Hong, J. H. Raeburn, I. Szymanski, W. 2002. The ideal structure of the C*-algebras of infinite graphs. Illinois Journal of Mathematics. 46: 1159-1176.
Bates, T., Pask, D., Raeburn, I. Szymanski, W. 2000. The C*-algebras of row-finite graphs. New York Journal of Mathematics. 6: 307-324.
Duncan, B. 2010. Certain free products of graph operator algebras. Journal of Mathematical Analysis and Applications. 364: 534-543.
Raeburn, I. 2005. Graph Algebras. American Mathematicalc Society, Providence. RI.
Szymanski, W. 2001. Simpliciy of Cuntz-Krieger algebras of infinite matrices, Pacific Journal of Mathematics. 199: 249-256.
Tomforde, M. 2006. Structure of graph C*-algebras and their generalization. Chapter in the book “Graph Algebras: Bridging the gap between analysis and algebra'', Eds. G. ArandaPino, F. PereraDomenech, and M. Siles Molina, Servicio de Publicaciones de la Universidad de Malaga, Malaga, Spain.
