Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 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

Classifying tilting complexes over preprojective algebras of Dynkin type (1509.07387v3)

Published 24 Sep 2015 in math.RT and math.RA

Abstract: We study tilting complexes over preprojective algebras of Dynkin type. We classify all tilting complexes by giving a bijection between tilting complexes and the braid group of the corresponding folded graph. In particular, we determine the derived equivalence class of the algebra. For the results, we develop the theory of silting-discrete triangulated categories and give a criterion of silting-discreteness.

Summary

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