Related papers: Classical Dimers on Penrose Tilings
We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can…
The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…
We studied the rigidity percolation (RP) model for aperiodic (quasi-crystal) lattices. The RP thresholds (for bond dilution) were obtained for several aperiodic lattices via computer simulation using the "pebble game" algorithm. It was…
In a region R consisting of unit squares, a (domino) tiling is a collection of dominoes (the union of two adjacent squares) which pave fully the region. The flip graph of R is defined on the set of all tilings of R where two tilings are…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
We investigate the distributed complexity of maximal matching and maximal independent set (MIS) in hypergraphs in the LOCAL model. A maximal matching of a hypergraph $H=(V_H,E_H)$ is a maximal disjoint set $M\subseteq E_H$ of hyperedges and…
We extend the classical Domino problem to any tiling of rhombus-shaped tiles. For any subshift X of edge-to-edge rhombus tilings, such as the Penrose subshift, we prove that the associated X-Domino problem is $\Pi^0_1$ -hard and therefore…
We study classical hard-core dimer models on the square lattice with links extending beyond nearest-neighbors. Numerically, using a directed-loop Monte Carlo algorithm, we find that, in the presence of longer dimers preserving the bipartite…
Photonic modes exhibiting a polarization winding akin to a vortex possess an integer topological charge. Lasing with topological charge 1 or 2 can be realized in periodic lattices of up to six-fold rotational symmetry. Higher order charges…
Classical Landau theory considers structural phase transitions and crystallization as a condensation of several critical density waves whose wave vectors are symmetrically equivalent. Analyzing the simplest nonequilibrium Landau potentials…
"Dominos" are special entities consisting of a hard dimer-like kernel surrounded by a soft hull and governed by local interactions. "Soft hull" and "hard kernel" mean that the hulls can overlap while the kernel acts under a repulsive…
We consider ergodic translation-invariant Gibbs measures for the dimer model (i.e. perfect matchings) on the hexagonal lattice. The complement to a dimer configuration is a fully-packed loop configuration: each vertex has degree two. This…
The purpose of this article is to view Penrose rhombus tilings from the perspective of symplectic geometry. We show that each thick rhombus in such a tiling can be naturally associated to a highly singular 4-dimensional compact symplectic…
Percolation and jamming phenomena are investigated for anisotropic sequential deposition of dimers (particles occupying two adjacent adsorption sites) on a square lattice. The influence of dimer alignment on the electrical conductivity was…
In a recent letter, Stenull and Lubensky claim that periodic approximants of Penrose tilings, which are generically isostatic, have a nonzero bulk modulus B when disordered, and, therefore, Penrose tilings are good models of jammed…
In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…
The classical dimer model is concerned with the (weighted) enumeration of perfect matchings of a graph. An $n$-dimer cover is a multiset of edges that can be realized as the disjoint union of $n$ individual matchings. For a probability…
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…
We collect a number of striking recent results in a study of dimers on infinite regular bipartite lattices and also on regular bipartite graphs. We clearly separate rigorously proven results from conjectures. A primary goal is to show…