Maximal rigid objects as noncrossing bipartite graphs
Representation Theory
2011-11-10 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1111.2306,
title = {Maximal rigid objects as noncrossing bipartite graphs},
author = {Raquel Coelho Simoes},
journal= {arXiv preprint arXiv:1111.2306},
year = {2011}
}
Comments
27 pages, 30 figures