arXiv · 1405.5922
Ionescu's theorem for higher rank graphs
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.
Explore related subjects
Keep this discovery
S. Kaliszewski, Adam Morgan, John Quigg. 2014-05-22. Ionescu's theorem for higher rank graphs. https://arxiv.org/abs/1405.5922
Cite the original work for its findings. Save a collection to share your selection of sources.