Abstract

We define and study a recurrence relation in Z3, called the hexahedron recurrence, which is similar to the octahedron recurrence (Hirota bilinear difference equation) and cube recurrence (Miwa equation). Like these examples, solutions to the hexahedron recurrence are partition sums for edge configurations on a certain graph, and have a natural interpretation in terms of cluster algebras. We give an explicit correspondence between monomials in the Laurent expansions arising in the recurrence with certain double-dimer configurations of a graph. We compute limit shapes for the corresponding double-dimer configurations.The Kashaev difference equation arising in the Ising model Y-Delta relation is a special case of the hexahedron recurrence. In particular this reveals the cluster nature underlying the Ising model. The above relation allows us to prove a Laurent phenomenon for the Kashaev difference equation.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call