Combinatorial frameworks for cluster algebras

Details Combinatorial frameworks for cluster algebras Combinatorial frameworks for cluster algebras

2011-11-11

arxiv.org/abs/1111.2652v1

Mathematics

Combinatorics

44 pages, 2 figures

Scientific paper

We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model incorporating information about exchange matrices, principal coefficients, g-vectors, g-vector fans, and (conjecturally) denominator vectors. The idea behind frameworks arises from Cambrian combinatorics and sortable elements, and in this paper, we use sortable elements to construct a framework for any cluster algebra with an acyclic initial exchange matrix. This Cambrian framework yields a model of the entire (principal coefficients) exchange graph when the cluster algebra is of finite type. Outside of finite type, the Cambrian framework models only part of the exchange graph. In a forthcoming paper, we extend the Cambrian construction to produce a complete framework for a cluster algebra whose associated Cartan matrix is of affine type.

Affiliated with

Also associated with

No associations

Rating

Combinatorial frameworks for cluster algebras 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 Combinatorial frameworks for cluster algebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial frameworks for cluster algebras will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-139238