Bazier-Matte Véronique, Huang Ruiyan, Luo Hanyi
Published 2020-09-12Version 1
Consider a M\"obius 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\"obius 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\"obius strip.
Connections between graphs and matrix spaces
Some acyclic systems of permutations are not realizable by triangulations of a product of simplices
A classification of centrally-symmetric and cyclic 12-vertex triangulations of $S^2 \times S^2$
![QR code for arXiv:2009.05785 [math.CO]](http://oss.arxitics.com/images/favicon.svg)