Higher-rank dimer models

TL;DR

This paper generalizes Kasteleyn's theorem to higher-rank dimer models on bipartite planar graphs, introducing connections, trace functions, and determinantal solutions for complex vertex models.

Contribution

It extends classical dimer theory by incorporating higher-rank connections and traces, enabling analysis of advanced vertex models like the 6-vertex and 20-vertex models.

Findings

Generalized Kasteleyn's theorem for higher-rank models

Established determinantal solutions for free fermionic subvarieties

Connected multiweb systems to scalar bipartite graph models

Abstract

Let $G$ be a bipartite planar graph with edges directed from black to white. For each vertex $v$ let $n_v$ be a positive integer. A multiweb in $G$ is a multigraph with multiplicity $n_v$ at vertex $v$. A connection is a choice of linear maps on edges $\Phi=\{\phi_{bw}\}_{bw\in E}$ where $\phi_{bw}\in \mathrm{Hom}({\mathbb R}^{n_b},{\mathbb R}^{n_w})$. Associated to $\Phi$ is a function on multiwebs, the trace $Tr_{\Phi}$. We define an associated Kasteleyn matrix $K=K(\Phi)$ in this setting and write $\det K$ as the sum of traces of all multiwebs. This generalizes Kasteleyn's theorem and the result of [Douglas, Kenyon, Shi: Dimers, webs, and local systems, Trans. AMS 2023]. We study connections with positive traces, and define the associated probability measure on multiwebs. By careful choice of connection we can thus encode the "free fermionic" subvarieties for vertex models such as the $6$-vertex model and $20$-vertex models, and in particular give determinantal solutions. We also find for each multiweb system an equivalent scalar system, that is, a planar bipartite graph $H$ and a local measure-preserving mapping from dimer covers of $H$ to multiwebs on $G$. We identify a family of positive connections as those whose scalar versions have positive face weights.