Purely infinite simple Kumjian-Pask algebras

Abstract

Given any finitely aligned higher-rank graph and any unital commutative ring R, the Kumjian-Pask algebra KPR() is known as the higher-rank generalization of Leavitt path algebras. After characterizing simple Kumjian-Pask algebras by L.O. Clark and Y.E.P. Pangalela (and others), we focus in this article on the purely infinite simple ones. Briefly, we show that if KPR() is simple and every vertex of is reached from a generalized cycle with an entrance, then KPR() is purely infinite. We next prove a standard dichotomy for simple Kumjian-Pask algebras: in the case that each vertex of is reached only from finitely many vertices and KPR() is simple, then KPR() is either purely infinite or locally matritial. This result covers all unital simple Kumjian-Pask algebras.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…