莫比乌斯带的三角剖分数目
Number of Triangulations of a Möbius Strip
AI总结:
该研究推导了边缘带n个选点的莫比乌斯带的三角剖分计数公式,并建立了其与对应拟团簇代数团簇数目的联系。
摘要:
考虑边缘上选取n个点的莫比乌斯带。三角剖分是这些点之间弧的极大集合,将带子分割为若干三角形。本文证明了边缘带n个选点的莫比乌斯带可得到的所有三角剖分的数目为4^{n-1}+\inom{2n-2}{n-1},随后建立了该数目与源自莫比乌斯带的拟团簇代数中团簇数目的关联。
英文摘要:
Consider a Möbius strip with $n$ chosen points on its edge. A triangulation is a maximal collection of arcs among these points and cuts the strip into triangles. In this paper, we proved the number of all triangulations that one can obtain from a Möbius strip with $n$ chosen points on its edge is given by $4^{n-1}+\binom{2n-2}{n-1}$, then we made the connection with the number of clusters in the quasi-cluster algebra arising from the Möbius strip.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。