相关论文: Tilings of $(2\times2\times n)$-board with colored…
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…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…
The number of ways to tile an $n$-board (an $n\times1$ rectangular board) with $(\frac12,\frac12;1)$-, $(\frac12,\frac12;2)$-, and $(\frac12,\frac12;3)$-combs is $T_{n+2}^2$ where $T_n$ is the $n$th tribonacci number. A…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…
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…
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.…
We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…
We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
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…
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…
In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…
This paper focuses on the undecidability of translational tiling of $n$-dimensional space $\mathbb{Z}^n$ with a set of $k$ tiles. It is known that tiling $\mathbb{Z}^2$ with translated copies with a set of $8$ tiles is undecidable.…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
We show that three dimensional cubes of any size can be tiled with trominoes and, when necessary, one or two singletons in any positions. Cubes of side length a multiple of three can always be tiled with trominoes (known), cubes of side…
In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…
This paper characterizes when an $m \times n$ rectangle, where $m$ and $n$ are integers, can be tiled (exactly packed) by squares where each has an integer side length of at least 2. In particular, we prove that tiling is always possible…
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…
In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.