Recollements, sinks elimination and Leavitt path algebras
Abstract
For Leavitt path algebras, we show that whereas removing sources from a graph produces a Morita equivalence, removing sinks gives rise to a recollement situation. In general, we show that for a graph E and a finite hereditary subset H of E0 there is a recollement LK(E/ H) [r] & @<3pt>[l] @<-3pt>[l] LK(E) [r] & @<3pt>[l] @<-3pt>[l] LK(EH) . We record several corollaries.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.