Related papers: Fast domino tileability
The question of whether a given region can be successfully filled by a finite set of tiles has been commonly studied, and there are many available arguments for whether a given finite region can be tiled. We can show that there is no domino…
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…
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretation of the order given by this lattice, using (not…
We consider domino tilings of $3$-dimensional cubiculated regions. A three-dimensional domino is a 2x2x1 rectangular cuboid. We are particularly interested in regions of the form $R_N = D \times [0,N]$ where $D$ is a fixed quadriculated…
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…
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…
About a decade ago Thurston proved that a vast collection of 3-manifolds carry metrics of constant negative curvature. These manifolds are thus elements of {\em hyperbolic geometry}, as natural as Euclid's regular polyhedra. For a closed…
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…
We analyze asymptotic height function fluctuations in uniformly random domino tiling models on multiply connected Temperleyan domains. Starting from asymptotic formulas derived by Kenyon [arXiv:math-ph/9910002v1], we show that (1) the…
Aperiodic tilings are non-periodic tilings characterized by local constraints. They play a key role in the proof of the undecidability of the domino problem (1964) and naturally model quasicrystals (discovered in 1982). A central question…
We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…
P. Di Francesco first introduced the "Aztec triangle" in his study of the relationship between the twenty-vertex model and domino tilings. He conjectured an exact formula for the number of tilings of the Aztec triangle, and it has since…
In this paper we study different kinds of symmetries related to the domino tilings of chessboards.
We consider three-dimensional domino tilings of cylinders $\mathcal{R}_N = \mathcal{D} \times [0,N]$ where $\mathcal{D} \subset \mathbb{R}^2$ is a fixed quadriculated disk and $N \in \mathbb{N}$. A domino is a $2 \times 1 \times 1$ brick. A…
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…
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…
We consider a problem concerning tilings of rectangular regions by a finite library of polyominoes. We specifically look at rectangular regions of dimension $n\times m$ and ask whether or not a tiling of this region can be rearranged so…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.
There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves…