The decomposition algorithm for skew-symmetrizable exchange matrices

From MaRDI portal



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 cite{WG}. As a corollary, we use this algorithm to determine if a given skew-symmetrizable matrix has finite mutation type.


Summary: Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admit unfoldings to skew-symmetric matrices. We develop a combinatorial algorithm that determines if a given skew-symmetrizable matrix is of such type. This algorithm generalizes the one in Weiwen Gu's decomposition algorithm for median graph of triangulation of a bordered 2D surface. As a corollary, we use this algorithm to determine if a given skew-symmetrizable matrix has finite mutation type.











This page was built for publication: The decomposition algorithm for skew-symmetrizable exchange matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456315)