arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1001.0758math.CTmath.RA
收藏

集群倾斜和复杂性

Cluster tilting and complexity

Petter Andreas Bergh, Steffen Oppermann

摘要:

我们研究的概念,积极和消极的复杂性对对象的集群类别。第一个主要结果表明,出现的最大复杂性是一个,两个或无限的,这取决于底层遗传代数的表示类型。在第二个结果中,我们研究了簇倾斜代数的有界导出范畴,并证明了当代数是有限型或驯服型时,出现的最大复杂性要么为零,要么为一。

英文摘要:

We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the underlying hereditary algebra. In the the second result, we study the bounded derived category of a cluster tilted algebra, and show that the maximal complexity occurring is either zero or one whenever the algebra is of finite or tame type.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑