Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cohn path algebras of higher-rank graphs

Published 31 Mar 2016 in math.RA | (1604.00072v1)

Abstract: In this article, we introduce Cohn path algebras of higher-rank graphs. We prove that for a higher-rank graph $\Lambda $, there exists a higher-rank graph $T\Lambda $ such that the Cohn path algebra of $\Lambda $ is isomorphic to the Kumjian-Pask algebra of $T\Lambda $. We then use this isomorphism and properties of Kumjian-Pask algebras to study Cohn path algebras. This includes proving a uniqueness theorem for Cohn path algebras.

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.