English

Q-systems, Heaps, Paths and Cluster Positivity

Combinatorics 2015-03-13 v2 Statistical Mechanics Mathematical Physics math.MP Quantum Algebra Representation Theory

Abstract

We consider the cluster algebra associated to the QQ-system for ArA_r as a tool for relating QQ-system solutions to all possible sets of initial data. We show that the conserved quantities of the QQ-system are partition functions for hard particles on particular target graphs with weights, which are determined by the choice of initial data. This allows us to interpret the simplest solutions of the Q-system as generating functions for Viennot's heaps on these target graphs, and equivalently as generating functions of weighted paths on suitable dual target graphs. The generating functions take the form of finite continued fractions. In this setting, the cluster mutations correspond to local rearrangements of the fractions which leave their final value unchanged. Finally, the general solutions of the QQ-system are interpreted as partition functions for strongly non-intersecting families of lattice paths on target lattices. This expresses all cluster variables as manifestly positive Laurent polynomials of any initial data, thus proving the cluster positivity conjecture for the ArA_r QQ-system. We also give an alternative formulation in terms of domino tilings of deformed Aztec diamonds with defects.

Keywords

Cite

@article{arxiv.0811.3027,
  title  = {Q-systems, Heaps, Paths and Cluster Positivity},
  author = {P. Di Francesco and R. Kedem},
  journal= {arXiv preprint arXiv:0811.3027},
  year   = {2015}
}

Comments

106 pages, 38 figures

R2 v1 2026-06-21T11:43:06.034Z