SearcharxivSearch

arXiv subjects

David I. Robertson

Publications and source records attributed to David I. Robertson.

2 recordsLinked to original sources

Simplicity of C*-algebras associated to row-finite locally convex higher-rank graphs

In previous work, the authors showed that the C*-algebra C*(Λ) of a row-finite higher-rank graph Λwith no sources is simple if and only if Λ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.

math.OA

Simplicity of C*-algebras associated to higher-rank graphs

We prove that if Λis a row-finite k-graph with no sources, then the associated C^*-algebra is simple if and only if Λis cofinal and satisfies Kumjian and Pask's Condition (A). We prove that Condition (A) is equivalent to a suitably modified version of Robertson and Steger's original nonperiodicity condition (H3) which in particular involves only finite paths. We also characterise both cofinality and aperiodicity of Λin terms of ideals in C^*(Λ).

math.OA