Colored Vertex Models and Interacting Reverse Plane Partitions
Jonah Guse, David Jiang, David Keating
TL;DR
This work connects the combinatorics of reverse plane partitions (RPP) with integrable multicolored vertex models by constructing a 2-color Yang–Baxter framework that encodes interacting pairs of RPPs of the same shape. The authors establish a product-form generating function for volume-weighted interacting RPPs with interaction parameter $t$, and show that setting $t=0$ collapses the model to single RPPs, with a bijection proving equinumerosity by total volume. A detailed development of white/gray row weights, border-strip path formulations, and border-strip–based bijections underpins the main theorem and its $t\to 0$ limit. The results provide explicit generating functions and a concrete combinatorial mechanism (via border-strip slides) to relate coupled RPPs to ordinary RPPs, linking lozenge tilings and symmetric-function–oriented methods to integrable vertex-model techniques. Overall, the paper advances the interplay between combinatorial representation theory, tiling models, and exactly solvable lattice models, with potential implications for Schur processes and related areas of mathematical physics.
Abstract
We study the coupling of pairs of reverse plane partitions of the same shape by assigning a certain local interaction between the reverse plane partitions. We show that they are in bijection with a certain Yang-Baxter integrable colored vertex model. By utilizing the Yang-Baxter equation for this colored vertex model, we are able to compute the generating function for the interacting pairs of reverse plane partitions. We also give a bijection between the coupled pairs of reverse plane partitions with the interaction strength set to zero and a single reverse plane partition of the same shape.
