Defining an $m$-cluster category
Author:
Preprint
Abstract
In this paper, starting with a simply laced root system, we define a triangulated category which we call the $m$-cluster category, and we show that it 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.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Shellability and higher Cohen-Macaulay connectivity of generalized cluster complexesIsrael Journal of Mathematics, 2008
- Cluster mutation via quiver representationsCommentarii Mathematici Helvetici, 2008
- Faces of Generalized Cluster Complexes and Noncrossing PartitionsSIAM Journal on Discrete Mathematics, 2008
- Generalized cluster complexes via quiver representationsJournal of Algebraic Combinatorics, 2007
- Tilting theory and cluster combinatoricsAdvances in Mathematics, 2006
- On the enumeration of positive cells in generalized cluster complexes and Catalan hyperplane arrangementsJournal of Algebraic Combinatorics, 2006
- On triangulated orbit categoriesDocumenta Mathematica, 2005
- Y -systems and generalized associahedraAnnals of Mathematics, 2003
- Generalized associahedra via quiver representationsTransactions of the American Mathematical Society, 2003