Related papers: Signed shape tilings of squares

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…

The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…

We show that a rectangle can be signed tiled by ribbon L n-ominoes, n odd, if and only if it has a side divisible by n. A consequence of our technique, based on the exhibition of an explicit Groebner basis, is that any k-inflated copy of…

A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…

Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…

A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…

A self-affine tiling of a compact set G of positive Lebesgue measure is its partition to parallel shifts of a compact set which is affinely similar to G. We find all polyhedral sets (unions of finitely many convex polyhedra) that admit…

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed 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…

Let $X$ be any rational surface. We construct a tilting bundle $T$ on $X$. Moreover, we can choose $T$ in such way that its endomorphism algebra is quasi-hereditary. In particular, the bounded derived category of coherent sheaves on $X$ is…

We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…

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…

A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…

We show that every tiling of a convex set in the Euclidean plane $\mathbb{R}^2$ by equilateral triangles of mutually different sizes contains arbitrarily small tiles. The proof is purely elementary up to the discussion of one family of…

A square tiling of the unit square is said to have the minimal tile property if the smallest tile can tile all the other tiles. We show that in such a tiling, the smallest tile cannot be too small.

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…

We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…

This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…

It is well-known that plane partitions, lozenge tilings of a hexagon, perfect matchings on a honeycomb graph, and families of non-intersecting lattice paths in a hexagon are all in bijection. In this work we consider regions that are more…

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…