Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 171 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 38 tok/s Pro
GPT-5 High 43 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 442 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Periodic higher rank graphs revisited (1403.6848v2)

Published 26 Mar 2014 in math.OA and math.FA

Abstract: Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph $\Lambda$ is a natural generalization of a higher rank graph. A pullback of $\Lambda$ is constructed by pulling it back over a given monoid morphism to $P$, while a pushout of $\Lambda$ is obtained by modding out its periodicity $\Per\Lambda$, which is deduced from a natural equivalence relation on $\Lambda$. One of our main results in this paper shows that, for a class of higher rank graphs $\Lambda$, $\Lambda$ 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\Lambda)$. 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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.