Leavitt path algebras with bounded index of nilpotence
Abstract
In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence. We show that the Leavitt path algebra LK(E) has index of nilpotence at most n if and only if no cycle in the graph E has an exit and there is a fixed positive integer n such that the number of distinct paths that end at any given vertex v (including v, but not including the entire cycle c in case v lies on c) is less than or equal to n. Interestingly, the Leavitt path algebras having bounded index of nilpotence turn out to be precisely those that satisfy a polynomial identity. Furthermore, Leavitt path algebras with bounded index of nilpotence are shown to be directly-finite and to be Z-graded -V rings. As an application of our results, we answer an open question raised in JST whether an exchange -V ring has bounded index of nilpotence.
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.