Related papers: Tiling Rectangles and the Plane using Squares of I…

A 2-uniform tiling is an edge-to-edge tiling by regular polygons having $2$ distinct transitivity classes of vertices. There are 20 distinct 2-uniform tilings (these are of $14$ different types) on the plane, and since the plane is the…

The problem of classifying the convex pentagons that admit tilings of the plane is a long-standing unsolved problem. Previous to this article, there were 14 known distinct kinds of convex pentagons that admit tilings of the plane. Five of…

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…

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 quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…

We study edge-to-edge tilings of the sphere by edge congruent pentagons, under the assumption that there are tiles with all vertices having degree 3. We develop the technique of neighborhood tilings and apply the technique to completely…

We introduce and study the number of tilings of unit height rectangles with irrational tiles. We prove that the class of sequences of these numbers coincides with the class of diagonals of N-rational generating functions and a class of…

An integral self-affine tile is the solution of a set equation $\mathbf{A} \mathcal{T} = \bigcup_{d \in \mathcal{D}} (\mathcal{T} + d)$, where $\mathbf{A}$ is an $n \times n$ integer matrix and $\mathcal{D}$ is a finite subset of…

We consider tilings of a rectangle which is n units wide and m units long by non-overlapping 1 X 1 squares and s X s squares. Bivariate generating functions are computed with the Transfer Matrix Method for moderately large but fixed widths…

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general…

There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…

We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…

We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…

In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…

In this paper it is proved that there exist periodic monohedral tilings and finite seeds of colored tiles, which force non-periodic coloring of the whole plane