Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
143 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leavitt path algebras with finitely presented irreducible representations (1501.01781v1)

Published 8 Jan 2015 in math.RA

Abstract: Let E be an arbitrary graph, K be any field and let L be the corresponding Leavitt path algebra. Necessary and sufficient conditions (which are both algebraic and graphical) are given under which all the irreducible representations of L are finitely presented. In this case, the graph E turns out to be row finite and the cycles in E form an artinian partial ordered set under a defined preorder. When the graph E is finite, the above graphical conditions were shown to be equivalent to the algebra L having finite Gelfand-Kirillov dimension in a paper by Alahmadi, Alsulami, Jain and Zelmanov. Examples are constructed showing that this equivalence no longer holds if the graph is infinite and a complete description is obtained of Leavitt path algebras over arbitrary graphs having finite Gelfand-Kirillov dimension

Summary

We haven't generated a summary for this paper yet.