Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Polygon of recollements and $N$-complexes (1603.06056v1)

Published 19 Mar 2016 in math.CT and math.RT

Abstract: We study a structure of subcategories which are called a polygon of recollements in a triangulated category. First, we study a $2n$-gon of recollements in an $(m/n)$-Calabi-Yau triangulated category. Second, we show the homotopy category $\mathsf{K}(\mathsf{Mor}{N-1}(\mathcal{B}))$ of complexes of an additive category $\mathsf{Mor}{N-1}(\mathcal{B})$ of $N-1$ sequences of split monomorphisms of an additive category $\mathcal{B}$ has a $2N$-gon of recoLLMents. Third, we show the homotopy category $\mathsf{K}{N}(\mathcal{B})$ of $N$-complexes of $\mathcal{B}$ has also a $2N$-gon of recoLLMents. Finally, we show there is a triangle equivalence between $\mathsf{K}(\mathsf{Mor}{N-1}(\mathcal{B}))$ and $\mathsf{K}_{N}(\mathcal{B})$.

Summary

We haven't generated a summary for this paper yet.