相关论文: Stones, Bones, and Snakes: Tilability of the hexag…
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
Tilings are around us everywhere, and our curiosity draws us to study their properties. A tiling is a way of arranging pieces on a board, such that there is no space left uncovered, nor any space covered by more than one tile. In…
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 look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
Several articles deal with tilings with squares and dominoes of the well-known regular square mosaic in Euclidean plane, but not any with the hyperbolic regular square mosaics. In this article, we examine the tiling problem with colored…
We consider tilings of quadriculated regions by dominoes and of triangulated regions by lozenges. We present an overview of results concerning tileability, enumeration and the structure of the space of tilings.
In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
Decorating the Spectre tile with hexagons reveals triangular hexagonal clusters whose structure we study. In the process we reprove that the Spectre tilings exist and are uniquely hierarchical. The proof is not computer-assisted.
In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
We classify all edge-to-edge spherical isohedral 4-gonal tilings such that the skeletons are pseudo-double wheels. For this, we characterize these spherical tilings by a quadratic equation for the cosine of an edge-length. By the…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…
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…
One of the most fundamental problems in tiling theory is the domino problem: given a set of tiles and tiling rules, decide if there exists a way to tile the plane using copies of tiles and following their rules. The problem is known to be…
Given a periodic placement of copies of a tromino (either L or I), we prove co-RE-completeness (and hence undecidability) of deciding whether it can be completed to a plane tiling. By contrast, the problem becomes decidable if the initial…