论文标题
驯服路径代数的最大绿色序列的长度
Lengths of maximal green sequences for tame path algebras
论文作者
论文摘要
在本文中，我们研究了$ \ wideTilde {\ Mathbf {d}} $的最大绿色序列的最大长度和$ \ widetilde {\ Mathbf {e}} $，它使用瓷砖突变理论。我们表明，最大长度不取决于方向的选择，并明确确定它。此外，我们提供了一个程序，该程序计算给定的Dynkin/扩展Dynkin颤抖的所有最大绿色序列。
In this paper, we study the maximal length of maximal green sequences for quivers of type $\widetilde{\mathbf{D}}$ and $\widetilde{\mathbf{E}}$ by using the theory of tilting mutation. We show that the maximal length does not depend on the choice of the orientation, and determine it explicitly. Moreover, we give a program which counts all maximal green sequences by length for a given Dynkin/extended Dynkin quiver.
