相关论文: Fault-Free Tileability of Rectangles, Cylinders, T…
We study the covering of the plane by non-overlapping rhombus tiles, a problem well-studied only in the limiting case of dimer coverings of regular lattices. We go beyond this limit by allowing tiles to take any position and orientation on…
A tessellation or tiling is a collection of sets, called tiles, that cover a plane without gaps and overlaps. The present note is an invitation to get to know the beauty and majesty of tessellations and triangulation of orientable surfaces.
We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…
There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does the space of all tilings look like? These questions and…
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…
Given a graph $G$ we consider sequentially placing dimers on it, namely choosing a maximal independent subset of edges, i.e. edges that do not share common vertices. We study the number of vertices that do not belong to any edge found in…
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…
We will show that a necessary and sufficient condition for a Ferrers board (or Young Diagrams) to be fully tileable with 1x2 dominoes requires the board to be 2-colorable such that no color is adjacent to its own color using both induction…
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…
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…
Aperiodic tiling is a well-know area of research. First developed by mathematicians for the mathematical challenge they represent and the beauty of their resulting patterns, they became a growing field of interest when their practical use…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…
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 consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
We present a new type of polyominoes that can have transparent squares (holes). We show how these polyominoes can tile rectangles and we categorise them according to their tiling ability. We were able to categorise all but 6 polyominoes…
We consider tromino tilings of $m\times n$ domino-deficient rectangles, where $3|(mn-2)$ and $m,n\geq0$, and characterize all cases of domino removal that admit such tilings, thereby settling the open problem posed by J. M. Ash and S.…
In this paper, we consider domino tilings of regions of the form $\mathcal{D} \times [0,n]$, where $\mathcal{D}$ is a simply connected planar region and $n \in \mathbb{N}$. It turns out that, in nontrivial examples, the set of such tilings…
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 consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…