English

Classification and Ideal Lattices of Leavitt Path Algebras

Rings and Algebras 2025-10-09 v1 Combinatorics

Abstract

Leavitt path algebras are free algebras subject to relations induced by directed graphs. This paper investigates the ideals of Leavitt path algebras, with an emphasis on the relationship between graph-theoretic properties of a directed graph and the ideals of the associated Leavitt path algebra. We begin by presenting a new proof of a fundamental result characterizing graded and non-graded ideals of a Leavitt path algebra using a condition on the number of closed paths at each vertex in its directed graph. Appealing to this result, we then classify the Leavitt path algebras of directed graphs with two vertices up to isomorphism and determine all possible lattice structures of a class of well-behaved ideals possessed by such algebras.

Keywords

Cite

@article{arxiv.2509.25464,
  title  = {Classification and Ideal Lattices of Leavitt Path Algebras},
  author = {Yvan Grinspan and Seth Yoo},
  journal= {arXiv preprint arXiv:2509.25464},
  year   = {2025}
}

Comments

21 pages, 4 figures