Simplicity of Leavitt path algebras via graded ring theory
Patrik Lundstr\"om, Johan \"Oinert

TL;DR
This paper characterizes when Leavitt path algebras are simple using graded ring theory, linking algebraic simplicity to graph properties and ring simplicity, and describes their centers.
Contribution
It provides a new characterization of simplicity for Leavitt path algebras via graded ring theory, connecting algebraic and graph-theoretic conditions.
Findings
Leavitt path algebra is simple iff R is simple, the graph has no nontrivial hereditary and saturated subsets, and every cycle has an exit.
Complete description of the center of a simple Leavitt path algebra.
Bridges algebraic simplicity with graph properties using graded ring theory.
Abstract
Suppose that is an associative unital ring and that is a directed graph. Utilizing results from graded ring theory we show, that the associated Leavitt path algebra is simple if and only if is simple, has no nontrivial hereditary and saturated subset, and every cycle in has an exit. We also give a complete description of the center of a simple Leavitt path algebra.
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
