相关论文: Signed tilings by ribbon L n-ominoes, n odd, via G…

A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…

Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…

To each permutation $\sigma$ in $S_{n}$ we associate a triangulation of a fixed $(n+2)$-gon. We then determine the fibers of this association and show that they coincide with the sylvester classes depicted By Novelli, Hivert and Thibon. A…

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…

We study tiling-based perimeter and characterize when a given perimeter tile appears in all rhombic tilings of an Elnitsky polygon. Regardless of where on the perimeter this tile appears, its forcing can be described in terms of…

We study tilings of polygons $R$ with arbitrary convex polygonal tiles. Such tilings come in continuous families obtained by moving tile edges parallel to themselves (keeping edge directions fixed). We study how the tile shapes and areas…

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…

Non-periodic tilings with Tile(1, 1) using the substitution method, as presented by Smith et al. in [2] and [3], can be converted into non-periodic tilings with three types of pentagons. When arbitrary replacements are excluded, the…

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…

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$…

We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…

This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings due to R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses direct-current circuits. The new approach of the paper is an…

An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC . We wish to…

An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex…

Kwasniewski's cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation…

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…

We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of the underlying graph, our proof is independent of the…

For nonempty subsets $X$ and $Y$ of a group $G$, we say that $(X,Y)$ is a tiling of $G$ if every element of $G$ can be uniquely expressed as $xy$ for some $x\in X$ and $y\in Y$. In 1966, Rothaus and Thompson studied whether the symmetric…

In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…

If n is a multiple of 4, then a square of side n can be tiled with T-tetrominos, using a well-known construction. If n is even but not a multiple of four, then there exists an equally well-known construction for tiling a square of side n…