Leavitt path algebras with bounded index of nilpotence
K. M. Rangaswamy, Ashish K. Srivastava

TL;DR
This paper characterizes Leavitt path algebras with bounded index of nilpotence through graph conditions, showing they satisfy polynomial identities and possess specific algebraic properties, thus answering an open question in the field.
Contribution
It provides a complete graphical characterization of Leavitt path algebras with bounded nilpotence index and links this property to polynomial identities and algebraic finiteness conditions.
Findings
Leavitt path algebra has bounded nilpotence index iff no cycle has an exit and path counts are bounded.
Such algebras satisfy polynomial identities.
They are directly-finite and $bZ$-graded $bSigma$-$V$ rings.
Abstract
In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence. We show that the Leavitt path algebra has index of nilpotence at most if and only if no cycle in the graph has an exit and there is a fixed positive integer such that the number of distinct paths that end at any given vertex (including , but not including the entire cycle in case lies on ) is less than or equal to . 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 -graded - rings. As an application of our results, we answer an open question raised in \cite{JST} whether an exchange - ring has bounded index…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Operator Algebra Research · Advanced Topics in Algebra · Algebraic structures and combinatorial models
