The decomposition algorithm for skew-symmetrizable exchange matrices (Q456315): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1202.0529 / rank | |||
Normal rank |
Latest revision as of 14:03, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The decomposition algorithm for skew-symmetrizable exchange matrices |
scientific article |
Statements
The decomposition algorithm for skew-symmetrizable exchange matrices (English)
0 references
24 October 2012
0 references
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.
0 references
cluster algebra
0 references
triangulation
0 references
integer exchange matrices
0 references
marked bordered surfaces
0 references
skew-symmetric matrices
0 references
combinatorial algorithm
0 references
median graph
0 references