2000 character limit reached
Recollements, sinks elimination and Leavitt path algebras (1602.05646v1)
Published 18 Feb 2016 in math.RA
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 $$\xymatrix{ L_K(E/\overline H) \rModd \ar[r] & \ar@<3pt>[l] \ar@<-3pt>[l] L_K(E) \rModd \ar[r] & \ar@<3pt>[l] \ar@<-3pt>[l] L_K(E_H) \rModd .}$$ We record several corollaries.
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.