Abstract

In this paper, we use the network solution of the ArA_r TT-system to derive that of the unrestricted A∞A_\infty TT-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 TT-systems are solved exactly in terms of networks. This gives a simple explanation for phenomena such as the Zamolodchikov periodicity property for TT-systems (corresponding to the case Aℓ×ArA_\ell\times A_r) and a combinatorial interpretation for the positive Laurent property of the variables of the associated cluster algebra. We also explain the relation between the TT-system wrapped on a torus and the higher pentagram maps of Gekhtman et al.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.