Maximal rigid objects as noncrossing bipartite graphs

Details Maximal rigid objects as noncrossing bipartite graphs Maximal rigid objects as noncrossing bipartite graphs

2011-11-09

arxiv.org/abs/1111.2306v1

Mathematics

Representation Theory

27 pages, 30 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maximal rigid objects as noncrossing bipartite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal rigid objects as noncrossing bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal rigid objects as noncrossing bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43378