Related papers: T-systems, networks and dimers
The $A_\infty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). We define T-systems with…
In this paper, we use the network solution of the $A_r$ $T$-system to derive that of the unrestricted $A_\infty$ $T$-system, equivalent to the octahedron relation. We then present a method for implementing various boundary conditions on…
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…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
Let S be a flat surface of genus g with cone type singularities. Given a bipartite graph G isoradially embedded in S, we define discrete analogs of the 2^{2g} Dirac operators on S. These discrete objects are then shown to converge to the…
In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like…
This is the second paper in the series devoted to the study of the dimer model on t-embeddings of planar bipartite graphs. We introduce the notion of perfect t-embeddings and assume that the graphs of the associated origami maps converge to…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
We define a non-commutative version of the $A_1$ T-system, which underlies frieze patterns of the integer plane. This system has discrete conserved quantities and has a particular reduction to the known non-commutative Q-system for $A_1$.…
We show that the dimer model on a bipartite graph on a torus gives rise to a quantum integrable system of special type - a cluster integrable system. The phase space of the classical system contains, as an open dense subset, the moduli…
The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By…
In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…
The purpose of this note is to give a succinct summary of some basic properties of T-graphs which arise in the study of the dimer model. We focus in particular on the relation between the dimer model on the heaxgonal lattice with a given…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights…
We propose a graph-based sweep algorithm for solving the steady state, mono-energetic discrete ordinates on meshes of high-order curved mesh elements. Our spatial discretization consists of arbitrarily high-order discontinuous Galerkin…
We use the consistency approach to classify discrete integrable 3D equations of the octahedron type. They are naturally treated on the root lattice $Q(A_3)$ and are consistent on the multidimensional lattice $Q(A_N)$. Our list includes the…
We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…
In a previous paper, we showed how certain orientations of the edges of a graph G embedded in a closed oriented surface S can be understood as discrete spin structures on S. We then used this correspondence to give a geometric proof of the…
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 propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…