2000 character limit reached
Q-system Cluster Algebras, Paths and Total Positivity
Published 18 Jun 2009 in q-fin.EC, cs.SI, and physics.soc-ph | (0906.3421v2)
Abstract: We review the solution of the Q-systems in terms of the partition function of paths on a weighted graph, and show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of planar networks introduced in the context of totally positive matrices by Fomin and Zelevinsky.
Paper Prompts
Sign up for free to create and run prompts on this paper.