Non-simply-laced Clusters of Finite Type via Frobenius Morphism
Representation Theory
2007-05-23 v2
Abstract
By showing the compatibility of folding almost positive roots and folding cluster categories, we prove that there is a one-to-one correspondence between seeds and tilting seeds in non-simply-laced finite cases.
Keywords
Cite
@article{arxiv.math/0608114,
title = {Non-simply-laced Clusters of Finite Type via Frobenius Morphism},
author = {Dong Yang},
journal= {arXiv preprint arXiv:math/0608114},
year = {2007}
}
Comments
15pages, also available at http://learn.tsinghua.edu.cn:8080/2002315664/dyang.htm