Related papers: Classical Dimers on Penrose Tilings
We define a quantum monomer-dimer model in the space of maximal dimer coverings of quasicrystalline Penrose tilings. Since Penrose tilings do not admit perfect dimer coverings, as shown by F. Flicker et al., PRX 10, 011005 (2020), monomers…
Penrose tilings form lattices, exhibiting 5-fold symmetry and isotropic elasticity, with inhomogeneous coordination much like that of the force networks in jammed systems. Under periodic boundary conditions, their average coordination is…
We study classical dimers on two-dimensional quasiperiodic Ammann-Beenker (AB) tilings. Despite the lack of periodicity we prove that each infinite tiling admits 'perfect matchings' in which every vertex is touched by one dimer. We…
Rhombus Penrose tilings are tilings of the plane by two decorated rhombi such that the decoration match at the junction between two tiles (like in a jigsaw puzzle). In dynamical terms, they form a tiling space of finite type. If we remove…
The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the…
We present a novel variant of a planar quasiperiodic tiling with tenfold symmetry, employing the same thick and thin rhombuses as the celebrated rhombic Penrose tiling. Despite its distinct visual appearance, this new tiling shares several…
We prove that the maximal graph-density of an independent set in a Penrose P3 tiling considered as a planar non-directed graph is equal to $(57 - 25 \sqrt{5})/2 \approx 0.54915$ despite the fact that the graph is bipartite. Accordingly, the…
We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…
We present a detailed study of a model of close-packed dimers on the square lattice with an interaction between nearest-neighbor dimers. The interaction favors parallel alignment of dimers, resulting in a low-temperature crystalline phase.…
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 prove that the number of monomer-dimer tilings of an $n\times n$ square grid, with $m<n$ monomers in which no four tiles meet at any point is $m2^m+(m+1)2^{m+1}$, when $m$ and $n$ have the same parity. In addition, we present a new proof…
The Penrose tiling is a perfectly ordered two dimensional structure with fivefold symmetry and scale invariance under site decimation. Quantum spin models on such a system can be expected to differ significantly from more conventional…
Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…
The decades-long search for a shape that tiles the plane only aperiodically under translations and rotations recently ended with the discovery of the `spectre' aperiodic monotile. In this setting we study the dimer model, in which dimers…
We present analytic results for a special dimer model on the {\em non-bipartite} and {\em non-planar} checkerboard lattice that does not allow for parallel dimers surrounding diagonal links. We {\em exactly} calculate the number of closed…
A relaxed version of Gummelt's covering rules for the aperiodic decagon is considered, which produces certain random-tiling-type structures. These structures are precisely characterized, along with their relationships to various other…
Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued…
We study a model of close-packed dimers on the square lattice with a nearest neighbor interaction between parallel dimers. This model corresponds to the classical limit of quantum dimer models [D.S. Rokhsar and S.A. Kivelson, Phys. Rev.…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…