Related papers: Conformal invariance of domino tiling
We consider domino tilings of three-dimensional cubiculated regions. A flip is a local move: two neighboring parallel dominoes are removed and placed back in a different position. The twist is an integer associated to each tiling, which is…
For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…
We show how to compute the probability of any given local configuration in a random tiling of the plane with dominos. That is, we explicitly compute the measures of cylinder sets for the measure of maximal entropy $\mu$ on the space of…
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…
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…
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…
We study random tiling models in the limit of high rotational symmetry. In this limit a mean-field theory yields reasonable predictions for the configurational entropy of free boundary rhombus tilings in two dimensions. We base our…
This is the first article in a series of two papers in which we study the Temperleyan dimer model on an arbitrary bounded Riemann surface of finite topolgical type. The end goal of both papers is to prove the convergence of height…
We consider statistical mechanics models of continuous height effective interfaces in the presence of a delta-pinning at height zero. There is a detailed mathematical understanding of the depinning transition in 2 dimensions without…
We introduce a new class of discrete approximations of planar domains that we call "hedgehog domains". In particular, this class of approximations contains two-step Aztec diamonds and similar shapes. We show that fluctuations of the height…
We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond at random according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of…
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…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…
This paper establishes a universality result for scaling limits of uniformly random lozenge tilings of large domains. We prove that whenever a boundary of the domain has three adjacent straight segments inclined under 120 degrees to each…
We study the asymptotic behavior of random domino tilings of the Aztec diamond of size $M$ in a random environment, where the environment is a one-periodic sequence of i.i.d. random weights attached to domino positions (i.e., to the edges…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
The famous domino shuffling algorithm was invented to generate the domino tilings of the Aztec Diamond. Using the domino height function, we view the domino shuffling procedure as a discrete-time random height process on the plane. The…
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…
We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…