Simplicity of C*-algebras associated to row-finite locally convex higher-rank graphsFaculty of Informatics - Papers (Archive)
AbstractIn a previous work, the authors showed that the C*-algebra C*(\Lambda) of a row-finite higher-rank graph \Lambda with no sources is simple if and only if \Lambda is both cofinal and aperiodic. In this paper, we generalise this result to row-finite higher-rank graphs which are locally convex (but may contain sources). Our main tool is Farthing's "removing sources" construction which embeds a row-finite locally convex higher-rank graph in a row-finite higher-rank graph with no sources in such a way that the associated C*-algebras are Morita equivalent.
Citation InformationDavid Robertson and Aidan Sims. "Simplicity of C*-algebras associated to row-finite locally convex higher-rank graphs" (2009) p. 171 - 192
Available at: http://works.bepress.com/asims/7/