Solutions to the T-systems with principal coefficients

zbMATH Open1339.05424arXiv1511.05535MaRDI QIDQ2629486FDOQ2629486

Authors: Panupong Vichitkunakorn 

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: The $A_{i}nfty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). 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 (Speyer 2007), generalized lambda-determinants (Di Francesco 2013) and (higher) pentagram maps (Schwartz 1992, Ovsienko et al. 2010, Glick 2011, Gekhtman et al. 2014).

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Triviality classes of solutions of some systems of equations with variable coefficients
• The Kirillov-Reshetikhin conjecture and solutions of T-systems
• scientific article; zbMATH DE number 4155356
• scientific article; zbMATH DE number 4112772
• scientific article; zbMATH DE number 6790660
• Publication:3490848
• scientific article; zbMATH DE number 4203772
• Tautologies and positive solvability of linear homogeneous systems
• Solving systems of linear equations with quasi-Toeplitz coefficient matrices
• On the solutions of tridiagonal linear systems

zbMATH Keywords

networkspathsdiscrete dynamical systemsdimers

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Binomial determinants, paths, and hook length formulae
• Alternating-sign matrices and domino tilings. II
• Cluster algebras. I: Foundations
• Cluster algebras IV: Coefficients
• Arctic curves of the octahedron equation
• \(Q\)-systems as cluster algebras. II: Cartan matrix of finite type and the polynomial property
• Perfect matchings and perfect powers
• On the Vector Representations of Induced Matroids
• Integrable cluster dynamics of directed networks and pentagram maps
• Title not available (Why is that?)
• \(T\)-systems and the pentagram map
• The pentagram map and \(Y\)-patterns
• The pentagram map: a discrete integrable system
• \(Y\)-meshes and generalized pentagram maps
• Perfect matchings and the octahedron recurrence
• Determinants and alternating sign matrices
• T-systems with boundaries from network solutions
• An inhomogeneous lambda-determinant
• The solution of the quantum \(A_1\) \(T\)-system for arbitrary boundary
• The solution of the A\(_{r}\) T-system for arbitrary boundary
• \(T\)-systems, networks and dimers
• Gale-Robinson sequences and brane tilings
• Cluster expansion formulas and perfect matchings
• Quantum \(A_r\,Q\)-system solutions as q-multinomial series
• Bessenrodt-Stanley polynomials and the octahedron recurrence

Cited In (6)

• The solution of the quantum \(A_1\) \(T\)-system for arbitrary boundary
• \(T\)-systems, networks and dimers
• The solution of the A\(_{r}\) T-system for arbitrary boundary
• Discrete Painlevé equations from Y-systems
• T-systems with boundaries from network solutions
• The Kirillov-Reshetikhin conjecture and solutions of T-systems

This page was built for publication: Solutions to the T-systems with principal coefficients

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