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 - 2015

Fingerprint

Graph in graph theory
Theorem
Product Systems
Groupoid
Correspondence
Tensor
Contact

Keywords

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

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Ionescu's theorem for higher-rank graphs. / Kaliszewski, Steven; Morgan, Adam; Quigg, John.

In: Indiana University Mathematics Journal, Vol. 64, No. 6, 2015, p. 1879-1901.

Research output: Contribution to journalArticle

@article{0787bc9d61df4a42903a114cdd06f0c0,
title = "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.",
keywords = "-algebra, Higher-rank graph C, Mauldin-Williams graph",
author = "Steven Kaliszewski and Adam Morgan and John Quigg",
year = "2015",
doi = "10.1512/iumj.2015.64.5709",
language = "English (US)",
volume = "64",
pages = "1879--1901",
journal = "Indiana University Mathematics Journal",
issn = "0022-2518",
publisher = "Indiana University",
number = "6",

}

TY - JOUR

T1 - Ionescu's theorem for higher-rank graphs

AU - Kaliszewski, Steven

AU - Morgan, Adam

AU - Quigg, John

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - -algebra

KW - Higher-rank graph C

KW - Mauldin-Williams graph

UR - http://www.scopus.com/inward/record.url?scp=84956656263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956656263&partnerID=8YFLogxK

U2 - 10.1512/iumj.2015.64.5709

DO - 10.1512/iumj.2015.64.5709

M3 - Article

AN - SCOPUS:84956656263

VL - 64

SP - 1879

EP - 1901

JO - Indiana University Mathematics Journal

JF - Indiana University Mathematics Journal

SN - 0022-2518

IS - 6

ER -