2000 character limit reached
Simplicity of Leavitt path algebras via graded ring theory
Published 18 Nov 2022 in math.RA and math.OA | (2211.10233v2)
Abstract: Suppose that $R$ is an associative unital ring and that $E=(E0,E1,r,s)$ is a directed graph. Utilizing results from graded ring theory we show, that the associated Leavitt path algebra $L_R(E)$ is simple if and only if $R$ is simple, $E0$ has no nontrivial hereditary and saturated subset, and every cycle in $E$ has an exit. We also give a complete description of the center of a simple Leavitt path algebra.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.