Solutions to the T-systems with principal coefficients (Q2629486)

Summary: The \(A_\infty\) T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra. We define T-systems with principal coefficients from cluster algebra aspect, and give combinatorial solutions with respect to any valid initial condition in terms of partition functions of perfect matchings, non-intersecting paths and networks. This also provides a solution to other systems with various choices of coefficients on T-systems including Speyer's octahedron recurrence, generalized lambda-determinants and (higher) pentagram maps.