Papers
Topics
Authors
Recent
Search
2000 character limit reached

A note on stable recollements

Published 7 Jul 2016 in math.CT and math.AG | (1607.02064v1)

Abstract: In this short \'etude, we observe that the full structure of a recollement on a stable infinity-category can be reconstructed from minimal data: that of a reflective and coreflective full subcategory. The situation has more symmetry than one would expect at a glance. We end with a practical lemma on gluing equivalences along a recollement.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.