Non-simply-laced Clusters of Finite Type via Frobenius Morphism

Simple item page
dc.creatorYang, Dong
dc.date2006-08-04
dc.date2006-08-07
dc.date.accessioned2026-07-07T07:21:24Z
dc.date.available2026-07-07T07:21:24Z
dc.descriptionBy 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.
dc.description15pages, also available at http://learn.tsinghua.edu.cn:8080/2002315664/dyang.htm
dc.identifierhttps://arxiv.org/abs/math/0608114
dc.identifierhttp://arxiv.org/abs/math/0608114
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115288
dc.subjectRepresentation Theory
dc.subject16G20
dc.titleNon-simply-laced Clusters of Finite Type via Frobenius Morphism
dc.typetext

Files

Collections

arXiv