New Graphs of Finite Mutation Type

Details New Graphs of Finite Mutation Type New Graphs of Finite Mutation Type

2008-04-04

arxiv.org/abs/0804.0787v1

Mathematics

Combinatorics

14 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

New Graphs of Finite Mutation Type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New Graphs of Finite Mutation Type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Graphs of Finite Mutation Type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-191235