The Decomposition Algorithm of Skew-symmetrizable Exchange Matrices
Abstract
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that determines if a given skew-symmetrizable matrix is of such type. This algorithm generalizes the one in WG. As a corollary, we use this algorithm to determine if a given skew-symmetrizable matrix has finite mutation type.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.