Defining an $m$-cluster category

Author:
Preprint
Publisher website
Google Scholar
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. This allows us to give type-uniform proofs of certain results of Fomin and Reading in the simply laced cases.

This publication has 10 references indexed in Scilit: