Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ladders and simplicity of derived module categories

Published 13 Oct 2013 in math.RT | (1310.3479v3)

Abstract: Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to another level of derived category. Ladders also turn out to control derived simplicity on all levels. An algebra is derived simple if its derived category cannot be deconstructed, that is, if it is not the middle term of a non-trivial recollement whose outer terms are again derived categories of algebras. Derived simplicity on each level is characterised in terms of heights of ladders. These results are complemented by providing new classes of examples of derived simple algebras, in particular indecomposable commutative rings, as well as by a finite-dimensional counterexample to the Jordan--H\"older property for derived module categories. Moreover, recollements are used to compute homological and K-theoretic invariants.

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.