Defining an m-cluster category
表示论
2007-09-10 v3 组合数学
摘要
We show that a certain orbit category considerd by Keller encodes the combinatorics of the -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.
引用
@article{arxiv.math/0607173,
title = {Defining an m-cluster category},
author = {Hugh Thomas},
journal= {arXiv preprint arXiv:math/0607173},
year = {2007}
}
备注
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