Related papers: Dimers and Circle patterns
We present a geometrical approach for studying dimers. We introduce a connection for dimer problems on bipartite and non-bipartite graphs. In the bipartite case the connection is flat but has non-trivial ${\bf Z}_2$ holonomy round certain…
Dimer models (also known as brane tilings) are special bipartite graphs on a torus $\mathbb{T}^2$. They encode the structure of the 4d $\mathcal{N} = 1$ worldvolume theories of D3 branes probing toric affine Calabi-Yau singularities.…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
We discuss the notion of s-embeddings $\mathcal{S}=\mathcal{S}_\mathcal{X}$ of planar graphs carrying a nearest-neighbor Ising model. The construction of $\mathcal{S}_\mathcal{X}$ is based upon a choice of a global complex-valued solution…
We prove that the marginal densities of a global probability mass function in a primal normal factor graph and the corresponding marginal densities in the dual normal factor graph are related via local mappings. The mapping depends on the…
We propose a generic framework to describe classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined sparse "coding" vector associated with the graph. We expect…
A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called…
We study the emergent orientational dynamics of a dumbbell dimer -- two asymmetric monomers connected by a linking spring -- in a three-dimensional chiral environment with odd viscosity. In classical systems with conserved parity symmetry,…
Isoradial graphs are a natural generalization of regular graphs which give, for many models of statistical mechanics, the right framework for studying models at criticality. In this survey paper, we first explain how isoradial graphs…
We consider two different versions of the double dimer model on a planar domain, where we either fold a single dimer cover on a symmetric domain onto itself across the line of symmetry, or we superimpose two independent dimer covers on two,…
Motivated by recent interest in 2+1 dimensional quantum dimer models, we revisit Fisher's mapping of two dimensional Ising models to hardcore dimer models. First, we note that the symmetry breaking transition of the ferromagetic Ising model…
In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues…
This paper completes the comprehensive study of the dimer model on infinite minimal graphs with Fock's weights [arXiv:1503.00289] initiated in [arXiv:2007.14699]: the latter article dealt with the elliptic case, i.e., models whose…
We consider the inverse scattering problem associated with any number of interacting modes in one-dimensional structures. The coupling between the modes is contradirectional in addition to codirectional, and may be distributed continuously…
Given a weighted graph $G$ embedded in a non-orientable surface $\Sigma$, one can consider the corresponding weighted graph $\widetilde{G}$ embedded in the so-called orientation cover $\widetilde\Sigma$ of $\Sigma$. We prove identities…
This note relates topics in statistical mechanics, graph theory and combinatorics, lattice quantum field theory, super quantum mechanics and string theory. We give a precise relation between the dimer model on a graph embedded on a torus…
Direct linkages between regular or irregular isometric embeddings of surfaces and steady compressible or incompressible fluid dynamics are investigated in this paper. For a surface $(M,g)$ isometrically embedded in $\mathbb{R}^3$, we…
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…
We present an algorithm to support the dynamic embedding in the plane of a dynamic graph. An edge can be inserted across a face between two vertices on the face boundary (we call such a vertex pair linkable), and edges can be deleted. The…
We study a simple model of bicycle motion: a segment of fixed length in multi-dimensional Euclidean space, moving so that the velocity of the rear end is always aligned with the segment. If the front track is prescribed, the trajectory of…