Papers
Topics
Authors
Recent
Search
2000 character limit reached

Kumjian-Pask algebras of finitely-aligned higher-rank graphs

Published 21 Dec 2015 in math.RA | (1512.06547v1)

Abstract: We extend the the definition of Kumjian-Pask algebras to include algebras associated to finitely aligned higher-rank graphs. We show that these Kumjian-Pask algebras are universally defined and have a graded uniqueness theorem. We also prove the Cuntz-Kreiger uniqueness theorem; to do this, we use a groupoid approach. As a consequence of the graded uniqueness theorem, we show that every Kumjian-Pask algebra is isomorphic to the Steinberg algebra associated to its boundary path groupoid. We then use Steinberg algebra results to prove the Cuntz-Kreiger uniqueness theorem and also to characterize simplicity and basic simplicity.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Collections

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