arXiv Analytics

Sign in

arXiv:math/0607173 [math.RT]AbstractReferencesReviewsResources

Defining an m-cluster category

Hugh Thomas

Published 2006-07-06, updated 2007-09-09Version 3

We show that a certain orbit category considerd by Keller encodes the combinatorics of the $m$-clusters of Fomin and Reading in a fashion similar to the way the cluster category of Buan, Marsh, Reineke, Reiten, and Todorov encodes the combinatorics of the clusters of Fomin and Zelevinsky. This allows us to give type-uniform proofs of certain results of Fomin and Reading in the simply laced cases.

Comments: Version 2 is substantially shorter, more focussed, and uses less machinery. Version 3 has minor revisions following referee's suggestions, and some sign corrections. To appear in J. Alg. 10 pages
Categories: math.RT, math.CO
Subjects: 16G20, 05E15
Related articles: Most relevant | Search more
arXiv:2004.08033 [math.RT] (Published 2020-04-17)
Combinatorics of Type D Exceptional Sequences
arXiv:1506.08927 [math.RT] (Published 2015-06-30)
Combinatorics of exceptional sequences in type A
arXiv:math/0610512 [math.RT] (Published 2006-10-17)
A geometric description of the m-cluster categories of type D_n