arXiv · math/0608114
Non-simply-laced Clusters of Finite Type via Frobenius Morphism
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dong Yang. 2006-08-07. Non-simply-laced Clusters of Finite Type via Frobenius Morphism. https://arxiv.org/abs/math/0608114
Cite the original work for its findings. Save a collection to share your selection of sources.