2000 character limit reached
Recollements and $n$-cotorsion pairs
Published 7 Mar 2024 in math.CT | (2403.04220v1)
Abstract: In the present paper, we study the relationships of $n$-cotorsion pairs among three abelian categories in a recollement. Under certain conditions, we present an explicit construction of gluing of $n$-cotorsion pairs in an abelian category $\mathcal{D}$ with respect to $n$-cotorsion pairs in abelian categories $\mathcal{D}{'}$, $\mathcal{D}{''}$ respectively. On the other hand, we study the construction of $n$-cotorsion pairs in abelian categories $\mathcal{D}{'}$, $\mathcal{D}{''}$ obtained from $n$-cotorsion pairs in an abelian category $\mathcal{D}$.
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.