Periodic higher rank graphs revisited

preprint2014arXivOpen access

Abstract

Let PP be a finitely generated cancellative abelian monoid. A PP-graph ΛΛ is a natural generalization of a higher rank graph. A pullback of ΛΛ is constructed by pulling it back over a given monoid morphism to PP, while a pushout of ΛΛ is obtained by modding out its periodicity $\PerΛ$, which is deduced from a natural equivalence relation on ΛΛ. One of our main results in this paper shows that, for a class of higher rank graphs ΛΛ, ΛΛ is isomorphic to the pullback of its pushout via a natural quotient map, and that its graph C*-algebra can be embedded into the tensor product of the graph C*-algebra of its pushout and $\ca(\PerΛ)$. As a consequence, its cycline C*-algebra generated by the standard generators with equivalent pairs is an abelian core (particularly a MASA). Along the way, we give an in-depth study on periodicity of PP-graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.