article

Title: Ionescu's theorem for higher-rank graphs

Authors: John Quigg, Steve Kaliszewski and Adam Morgan

Issue: Volume 64 (2015), Issue 6, 1879-1901

Abstract:

$We will define new constructions similar to the graph systems of correspondences described by Deaconu \emph{et al}. We will use these to prove a version of Ionescu's theorem for higher-rank graphs. Afterwards, we will examine the properties of these constructions further, and make contact with Yeend's topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims.$