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

Hom-configurations and noncrossing partitions (1012.1276v1)

Published 6 Dec 2010 in math.RT and math.CO

Abstract: Let Q be a Dynkin quiver. 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 study maximal Hom-free sets in the corresponding orbit category C(Q). We prove that these sets are in bijection with periodic combinatorial configurations, as introduced by Riedtmann, certain Hom<=0-configurations, studied by Buan, Reiten and Thomas, and noncrossing partitions of the Coxeter group associated to Q which are not contained in any proper standard parabolic subgroup. Note that Reading has proved that these noncrossing partitions are in bijection with positive clusters in the associated cluster algebra. Finally, we give a definition of mutations of maximal Hom-free sets in C(Q) and prove that the graph of these mutations is connected.

Summary

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