Related papers: Combinatorics of the Dimer Model on a Strip
We describe the relationship between dimer models on the real two-torus and coamoebas of curves in (\CC^\times)^2. We show, inter alia, that the dimer model obtained from the shell of the coamoeba is a deformation retract of the closed…
We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect…
We show that finding minimally intersecting $n$ paths from $s$ to $t$ in a directed graph or $n$ perfect matchings in a bipartite graph can be done in polynomial time. This holds more generally for unimodular set systems.
In this paper, we prove sharp estimates for the average cost of the optimal matching problem on the flat 2-torus, using quantitative linearization and the method of trajectories.
We study a generalisation of the double-dimer model that encompasses several models of interest, including the monomer double-dimer model, spatial random permutations, the dimer model, and the spin $O(N)$ model, and which is also related to…
We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We prove the existence of a limit shape for the dimer model on planar periodic bipartite graphs with an arbitrary fundamental domain and arbitrary periodic weights. This proof is based on a variational principle that uses the locality of…
We study the correlations of classical hardcore dimer models doped with monomers by Monte Carlo simulation. We introduce an efficient cluster algorithm, which is applicable in any dimension, for different lattices and arbitrary doping. We…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…
It is shown that dimers is Yang-Baxter integrable as a six-vertex model at the free-fermion point with crossing parameter $\lambda=\tfrac{\pi}{2}$. A one-to-many mapping of vertex onto dimer configurations allows the free-fermion solutions…
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…
We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…
We study various statistical properties of the double-dimer model, a generalization of the dimer model, on rectangular domains of the square lattice. We take advantage of the Grassmannian representation of the dimer model, first to…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…