Ionescu's theorem for higher-rank graphs

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)1879-1901
Number of pages23
JournalIndiana University Mathematics Journal
Volume64
Issue number6
DOIs
StatePublished - Jan 1 2015

Keywords

  • -algebra
  • Higher-rank graph C
  • Mauldin-Williams graph

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Ionescu's theorem for higher-rank graphs'. Together they form a unique fingerprint.

  • Cite this