T-systems with boundaries from network solutions
Abstract
In this paper, we use the network solution of the -system to derive that of the unrestricted -system, equivalent to the octahedron relation. We then present a method for implementing various boundary conditions on this system, which consists of picking initial data with suitable symmetries. The corresponding restricted -systems are solved exactly in terms of networks. This gives a simple explanation for phenomena such as the Zamolodchikov periodicity property for -systems (corresponding to the case ) and a combinatorial interpretation for the positive Laurent property of the variables of the associated cluster algebra. We also explain the relation between the -system wrapped on a torus and the higher pentagram maps of Gekhtman et al.
Cite
@article{arxiv.1208.4333,
title = {T-systems with boundaries from network solutions},
author = {Philippe Di Francesco and Rinat Kedem},
journal= {arXiv preprint arXiv:1208.4333},
year = {2012}
}
Comments
63 pages, 67 figures