Related papers: The Ammann-Beenker tilings revisited

In this paper we give a classification of tilings of the sphere by congruent quadrilaterals with exactly two equal edges. The tilings are the earth map tilings, $(p,q)$-earth map tilings and their flip modifications, and quadrilateral…

We develop the basic tools for classifying edge-to-edge tilings of the sphere by congruent pentagons. Then we prove that, for the edge combination $a^2b^2c$, such tilings are three two-parameter families of pentagonal subdivisions of the…

Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…

We show that given any tiling of Euclidean space, any geometric patterns of points, we can find a patch of tiles (of arbitrarily large size) so that copies of this patch appear in the tiling nearly centered on a scaled and translated…

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…

Wang tiles enable efficient pattern compression while avoiding the periodicity in tile distribution via programmable matching rules. However, most research in Wang tilings has considered tiling the infinite plane. Motivated by emerging…

We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…

How do people come up with new sets of tiles including new tile shapes that would only tile non-periodically? This paper presents our graphical journey in tilings and provides a new set of three polyominoes named Ax for its relationship…

We consider certain point patterns of an Euclidean space and calculate the Ellis enveloping semigroup of their associated dynamical systems. The algebraic structure and the topology of the Ellis semigroup, as well as its action on the…

Motivated by theoretically and experimentally observed structural phases with octagonal symmetry, we introduce a family of octagonal tilings which are composed of three prototiles. We define our tilings with respect to two non-negative…

This paper provides a bridge between the classical tiling theory and the complex neighborhood self-assembling situations that exist in practice. The neighborhood of a position in the plane is the set of coordinates which are considered…

The Spectre is an aperiodic monotile for the Euclidean plane that is truly chiral in the sense that it tiles the plane without any need for a reflected tile. The topological and dynamical properties of the Spectre tilings are very similar…

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…

We develop a unified framework for the study of properties involving diagonalizations of dense families in topological spaces. We provide complete classification of these properties. Our classification draws upon a large number of methods…

A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…

Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…

The new class of integrable mappings and chains is introduced. Corresponding (1+2) integrable systems invariant with respect to such discrete transformations are represented in explicit form. Soliton like solutions of them are represented…

An $n$-dimensional chair consists of an $n$-dimensional box from which a smaller $n$-dimensional box is removed. A tiling of an $n$-dimensional chair has two nice applications in coding for write-once memories. The first one is in the…