Ionescu's theorem for higher rank graphs
Operator Algebras
2015-12-07 v3
Abstract
We will define new constructions similar to the graph systems of correspondences described by Deaconu 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.
Cite
@article{arxiv.1405.5922,
title = {Ionescu's theorem for higher rank graphs},
author = {S. Kaliszewski and Adam Morgan and John Quigg},
journal= {arXiv preprint arXiv:1405.5922},
year = {2015}
}
Comments
minor changes