ﻻ يوجد ملخص باللغة العربية
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 description for the dimers, and via a recursion relation that was obtained from a map to a 1D monomer-dimer system. The problem of finding the number of perfect matchings can also be translated to the problem of finding a minmal feedback arc set on the dual graph.
The dimer model on a strip is considered as a Yang-Baxter mbox{integrable} six vertex model at the free-fermion point with crossing parameter $lambda=tfrac{pi}{2}$ and quantum group invariant boundary conditions. A one-to-many mapping of vertex onto
We examine the groundstate wavefunction of the rotor model for different boundary conditions. Three conjectures are made on the appearance of numbers enumerating alternating sign matrices. In addition to those occurring in the O($n=1$) model we find
Background: We study the sparsification of dynamic programming folding algorithms of RNA structures. Sparsification applies to the mfe-folding of RNA structures and can lead to a significant reduction of time complexity. Results: We analyze the spars
We consider the $(2+1)$-d $SU(2)$ quantum link model on the honeycomb lattice and show that it is equivalent to a quantum dimer model on the Kagome lattice. The model has crystalline confined phases with spontaneously broken translation invariance as
Here we observe that list coloring in graph theory coincides with the zero-temperature antiferromagnetic Potts model with an external field. We give a list coloring polynomial that equals the partition function in this case. This is analogous to the