Related papers: Classical Dimers on Penrose Tilings
We consider tiles (dimers) each of which covers two vertices of a rectangular lattice. There is a normalized translation invariant weighting on the shape of the tiles. We study the pressure, p, or entropy, (one over the volume times 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…
Covering a graph or a lattice with non-overlapping dimers is a problem that has received considerable interest in areas such as discrete mathematics, statistical physics, chemistry and materials science. Yet, the problem of percolation on…
The classic combinatorial construct of {\em maximum matchings} probes the random geometry of regions with local sublattice imbalance in a site-diluted bipartite lattice. We demonstrate that these regions, which host the monomers of any…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
In this article we study domino tilings of a family of finite regions called Aztec diamonds. Every such tiling determines a partition of the Aztec diamond into five sub-regions; in the four outer sub-regions, every tile lines up with nearby…
Maximum-density dimer packings (maximum matchings) of non-bipartite site-diluted lattices, such as the triangular and Shastry-Sutherland lattices in $d=2$ dimensions and the stacked-triangular and corner-sharing octahedral lattices in…
The vortex dynamics in superconducting films deposited on top of a five-fold Penrose array of magnetic dots is studied by means of transport measurements. We show that in the low pinning regime (demagnetized dots) a few periodic and…
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…
We give formulas for the density of visible points of several families of planar quasicrystals, which include the Ammann-Beenker point set and vertex sets of some rhombic Penrose tilings. These densities are used in order to calculate the…
We study the monomer--dimer partition function on the configuration model of random $d$-regular, $l$-uniform hypergraphs. For fixed $d,l\ge2$, we prove quenched free-energy limits in explicit parameter regimes. The proof combines…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
Recent studies of holographic tensor network models defined on regular tessellations of hyperbolic space have not yet addressed the underlying discrete geometry of the boundary. We show that the boundary degrees of freedom naturally live on…
A set of tiles for covering a surface is composed of two types of tiles. The base shape of each one of them is a diamond or rhombus, both with angles 60 and 120 degrees. They are distinguished by labeling one as an acute diamond with a base…
As a continuation to our previous work [9, 10], we consider the domino tiling problem with impurities. (1) if we have more than two impurities on the boundary, we can compute the number of corresponding perfect matchings by using the…
In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…
The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…
We solve the monomer-dimer problem on a non-bipartite lattice, the simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the non-bipartite nature of the lattice, the well-known…
We study perfect matchings, or close-packed dimer coverings, of finite sections of the eleven Archimedean lattices and give a constructive proof showing that any two perfect matchings can be transformed into each other using small sets of…