Related papers: Dimers, webs, and positroids
We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…
A dimer model is a quiver with faces embedded into a disk. A consistent dimer model gives rise to a strand diagram, and hence to a positroid. The Gorenstein-projective module category over the completed boundary algebra of a dimer model was…
We completely describe by inequalities the set of boundary correlation matrices of planar Ising networks embedded in a disk. Specifically, we build on a recent result of M.~Lis to give a simple bijection between such correlation matrices…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
We give a combinatorial interpretation for certain cluster variables in Grassmannian cluster algebras in terms of double and triple dimer configurations. More specifically, we examine several Gr(3,n) cluster variables that may be written as…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
The Pfaffian structure of the boundary monomer correlation functions in the dimer-covering planar graph models is rederived through a combinatorial / topological argument. These functions are then extended into a larger family of…
We associate a dimer algebra A to a Postnikov diagram D (in a disk) corresponding to a cluster of minors in the cluster structure of the Grassmannian Gr(k,n). We show that A is isomorphic to the endomorphism algebra of a corresponding…
In this article we use the cluster structure on the Grassmannian and the combinatorics of plabic graphs to exhibit a new aspect of mirror symmetry for Grassmannians in terms of polytopes. For our $A$-model, we consider the Grassmannian…
In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…
We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…
Amalgamation in the totally non-negative part of positroid varieties is equivalent to gluing copies of $Gr^{TP}(1,3)$ and $Gr^{TP}(2,3)$. Lam has proposed to represent amalgamation in positroid varieties by equivalence classes of relations…
We present an application of the Grassmann algebra to the problem of the monomer-dimer statistics on a two-dimensional square lattice. The exact partition function, or total number of possible configurations, of a system of dimers with a…
The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…
We introduce a family of spaces called critical varieties. Each critical variety is a subset of one of the positroid varieties in the Grassmannian. The combinatorics of positroid varieties is captured by the dimer model on a planar…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
We apply the Grassmannian representation of the dimer model, an equivalent approach to Kasteleyn's solution to the close-packed dimer problem, to calculate the connection probabilities for the double-dimer model with wired/free/wired/free…
We consider the dimer model on a bipartite graph embedded into a locally flat Riemann surface with conical singularities and satisfying certain geometric conditions in the spirit of the work of [Chelkak, Laslier and Russkikh, Proceedings of…