Periodic higher rank graphs revisited
Abstract
Let P be a finitely generated cancellative abelian monoid. A P-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 P, while a pushout of is obtained by modding out its periodicity , 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 (). 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 P-graphs.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.