Papers
Topics
Authors
Recent
2000 character limit reached

Kumjian-Pask algebras of locally convex higher-rank graphs

Published 23 Apr 2013 in math.RA | (1304.6421v2)

Abstract: The Kumjian-Pask algebra of a higher-rank graph generalises the Leavitt path algebra of a directed graph. We extend the definition of Kumjian-Pask algebra to row-finite higher-rank graphs $\Lambda$ with sources which satisfy a local-convexity condition. After proving versions of the graded-uniqueness theorem and the Cuntz-Krieger uniqueness theorem, we study the Kumjian-Pask algebra of rank-2 Bratteli diagrams by studying certain finite subgraphs which are locally convex. We show that the desourcification procedure of Farthing and Webster yields a row-finite higher-rank graph $\tilde{\Lambda}$ without sources such that the Kumjian-Pask algebras of $\tilde{\Lambda}$ and $\Lambda$ are Morita equivalent. We then use the Morita equivalence to study the ideal structure of the Kumjian-Pask algebra of $\Lambda$ by pulling the appropriate results across the equivalence.

Summary

Paper to Video (Beta)

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.