Corners of Leavitt path algebras of finite graphs are Leavitt path algebras
Gene Abrams, T. G. Nam

TL;DR
This paper characterizes corners of Leavitt path algebras of finite graphs as isomorphic to Leavitt path algebras, providing a constructive method to understand their structure and Morita equivalences.
Contribution
It proves that every nonzero corner of a Leavitt path algebra of a finite graph is itself a Leavitt path algebra, extending the understanding of their internal structure.
Findings
Corners of Leavitt path algebras are isomorphic to Leavitt path algebras.
Every unital algebra Morita equivalent to a Leavitt path algebra is isomorphic to one.
A step-by-step graph transformation process is established for analysis.
Abstract
We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra of a finite graph with coefficients in a field as a direct sum of matrix rings over , direct sum with a corner of the Leavitt path algebra of a graph for which every regular vertex is the base of a loop. Moreover, in this case one may transform the graph into the graph via some step-by-step procedure, using the "source elimination" and "collapsing" processes. We use this to establish the main result of the article, that every nonzero corner of a Leavitt path algebra of a finite graph is isomorphic to a Leavitt path algebra. Indeed, we prove a more general result, to wit, that the endomorphism ring of any nonzero finitely generated projective -module is isomorphic to the Leavitt path algebra of a graph explicitly constructed from . Consequently,…
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
