New graphs of finite mutation type

From MaRDI portal
Publication:1010876

zbMATH Open1180.05052arXiv0804.0787MaRDI QIDQ1010876FDOQ1010876


Authors: Theodore Owen, Harm Derksen Edit this on Wikidata


Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of cluster algebras by Fomin and Zelevinsky. The mutation class of a graph G is the set of all isomorphism classes of graphs that can be obtained from G by a sequence of mutations. A graph is called mutation-finite if its mutation class is finite. Fomin, Shapiro and Thurston constructed mutation-finite graphs from triangulations of oriented bordered surfaces with marked points. We will call such graphs "of geometric type". Besides graphs with 2 vertices, and graphs of geometric type, there are only 9 other "exceptional" mutation classes that are known to be finite. In this paper we introduce 2 new exceptional finite mutation classes.


Full work available at URL: https://arxiv.org/abs/0804.0787

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (24)





This page was built for publication: New graphs of finite mutation type

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