Combinatorial frameworks for cluster algebras

DOI10.1093/IMRN/RNV101zbMATH Open1330.05167arXiv1111.2652OpenAlexW1956547599WikidataQ57434546 ScholiaQ57434546MaRDI QIDQ5744702FDOQ5744702

Authors: Nathan Reading, David E Speyer 

Publication date: 19 February 2016

Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Abstract: 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, and g-vector fans. 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 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.

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

Recommendations

• Cambrian frameworks for cluster algebras of affine type
• A Cambrian framework for the oriented cycle
• An affine almost positive roots model
• Cluster algebras: an introduction
• Cluster algebras of type \(D\): pseudotriangulations approach

zbMATH Keywords

combinatorial models for cluster algebras

Mathematics Subject Classification ID

Cluster algebras (13F60)

Cited In (26)

• Minkowski decomposition of associahedra and related combinatorics
• Ungarian Markov chains
• Lattice homomorphisms between weak orders
• Universal geometric cluster algebras
• Coherent fans in the space of flows in framed graphs
• Affine cluster monomials are generalized minors
• Stack-sorting for Coxeter groups
• A combinatorial approach to scattering diagrams
• From the Tamari lattice to Cambrian lattices and beyond.
• Cambrian frameworks for cluster algebras of affine type
• Cluster algebras and symmetrizable matrices
• Acyclic cluster algebras revisited
• Cluster algebras and symmetric matrices
• Dominance phenomena: mutation, scattering and cluster algebras
• BGP-reflection functors and cluster combinatorics.
• The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
• A Cambrian framework for the oriented cycle
• A compendium on the cluster algebra and quiver package in \texttt{Sage}
• Diagrammatic description of \(c\)-vectors and \(d\)-vectors of cluster algebras of finite type
• Biclosed sets in affine root systems
• Towards a uniform subword complex description of acyclic finite type cluster algebras
• A conjecture on \(C\)-matrices of cluster algebras
• Extending the weak order on Coxeter groups
• Some consequences of categorification
• Classification of singularities of cluster algebras of finite type: the case of trivial coefficients
• An affine almost positive roots model

This page was built for publication: Combinatorial frameworks for cluster algebras

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