Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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 at most countably many irreducible representatios (1309.7917v2)

Published 30 Sep 2013 in math.RA

Abstract: Let E be an arbitrary directed graph with no restrictions on the number of vertices and edges and let K be any field. We give necessary and sufficient conditions for the Leavitt path algebra L_K(E) to be of countable irreducible representation type, that is, we determine when L_K(E)has at most countably many distinct isomorphism classes of simple left L_K(E-modules. It is also shown that L_K(E) has dinitely many isomorphism classes of simple left modules if and only if L_K(E) is a semi-artinian von Neumann regular ring with at most finitely many ideals. Equivalent conditions on the graph E are also given. Examples are constructed showing that for each (finite or infinite) cardinal m there exists a Leavitt path algebra L having exactly m distinct isomorphism classes of simple left modules.

Summary

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