Abstract

AbstractIn this survey article, we describe some of recent ring-theoretic and module-theoretic investigations of a Leavitt path algebra L of an arbitrary directed graph E over a field K. It is shown how a single graph-theoretical property of E often gives rise to several independent ring properties of L, thus making Leavitt path algebras as effective tools in constructing examples of rings with various desired properties. Leavitt path algebras satisfying a polynomial identity are completely described. It is shown how using special vertices, infinite paths or cycles in the graph E, various types of simple modules over L can be constructed. A complete description is given of a Leavitt path algebra L whose simple modules possess various specific properties such as being, flat, injective, graded or finitely presented. In the first three cases, L becomes von Neumann regular while in the last case, when the graph E is finite, L possesses finite GK-dimension. Leavitt path algebras having only finitely many isomorphism classes of simple modules turn out to be semi-artinian von Neumann regular rings in which the ideals form a finite chain under inclusion. The sum and the intersection of any two principal one-sided ideals of L are shown to be again principal one-sided ideals and this leads to the existence of the left/right gcd and the left/right lcm of any two non-zero elements in L.KeywordsLeavitt path algebrasGraph algebrasSimple modulesFinitely presented modulesClassification2010 Mathematics Subject Classification 16D5016D70

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.