Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 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

Maximal rigid objects as noncrossing bipartite graphs (1111.2306v1)

Published 9 Nov 2011 in math.RT and math.CO

Abstract: Let Q be a Dynkin quiver of type A. The bounded derived category of the path algebra of Q has an autoequivalence given by the composition of the Auslander-Reiten translate and the square of the shift functor. We classify the maximal rigid objects in the corresponding orbit category C(Q), in terms of bipartite noncrossing graphs (with loops) in a circle. We also describe the endomorphism algebras of the maximal rigid objects, and we prove that a certain class of these algebras are iterated tilted algebras of type A.

Summary

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