2-isohedral triangulations

A triangulations is 2-isohedral iff there are exactly two orbits of triangles under the triangulation's symmetry group. 2-isohedral triangulations are classified using incidence symbols. This also determines the homeomeric types of 2-isohedral triangulation. There are 38 types. The proof is by aggregation into isohedral tilings and by reflection axis splitting.     

The classification of 2-isohedral tilings of the plane

Two different methods for enumerating k-isohedral tilings are discussed. One is geometric: by splitting and gluing tiles. The other is combinatorial: by enumerating the appropriate Delaney—Dress symbols. Both methods yield 1270 types of proper 2-isohedral tilings of the plane.     

Isohedral tilings of a ribbon

The isohedral tilings of a ribbon or infinite strip are classified. There are 24 of them, 5 of which must be realized as either marked tilings or tilings of a ribbon with edges which are not straight lines.     

Fractal tiles associated with shift radix systems

Shift radix systems form a collection of dynamical systems depending on a parameter r which varies in the d-dimensional real vector space. They generalize well-known numeration systems such as beta-expansions, expansions with respect to rational bases, and canonical number systems. Beta-numeration and canonical number systems are known to be intimately related to fractal shapes, such as the classical Rauzy fractal and the twin dragon. These fractals turned out to be important for studying properties of expansions in several settings.In the present paper we associate a collection of fractal tiles with shift radix systems. We show that for certain classes of parameters r these tiles coincide with affine copies of the well-known tiles associated with beta-expansions and canonical number systems. On the other hand, these tiles provide natural families of tiles for beta-expansions with (non-unit) Pisot numbers as well as canonical number systems with (non-monic) expanding polynomials.We also prove basic properties for tiles associated with shift radix systems. Indeed, we prove that under some algebraic conditions on the parameter r of the shift radix system, these tiles provide multiple tilings and even tilings of the d-dimensional real vector space. These tilings turn out to have a more complicated structure than the tilings arising from the known number systems mentioned above. Such a tiling may consist of tiles having infinitely many different shapes. Moreover, the tiles need not be self-affine (or graph directed self-affine).     

On tile-k-transitive tilings of the space

General methods for finding tile-k-transitive tilings of the three-dimensional Euclidean space with polyhedral bodies are discussed. Analogous methods for enumerating k-isohedral tilings of a two-dimensional plane of constant curvature have been obtained previously.     

n-Homeohedral types of tilings

For each n, there are only finitely many topological types of normal n-homeohedral tilings, and for every such type there is an n-isohedral representative which displays essentially the same symmetries.     

Substitution tilings with statistical circular symmetry

Two new series of substitution tilings are introduced in which the tiles appear in infinitely many orientations. It is shown that several properties of the well-known pinwheel tiling do also hold for these new examples, and, in fact, for all primitive substitution tilings showing tiles in infinitely many orientations.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations

   Abstract. Tilings of R ² can display hierarchy similar to that seen in the limit sequences of substitutions. Self-similarity for tilings has been used as the standard generalization, but this viewpoint is limited because such tilings are analogous to limit points of constant-length substitutions. To generalize limit points of non-constant-length substitutions, we define hierarchy for infinite, labelled graphs, then extend this definition to tilings via their dual graphs. Examples of combinatorially substitutive tilings that are not self-similar are given. We then find a sufficient condition for detecting combinatorial hierarchy that is motivated by the characterization by Durand of substitutive sequences. That characterization relies upon the construction of the ``derived sequence'—a recoding in terms of reappearances of an initial block. Following this, we define the ``derived Vorono? tiling'—a retiling in terms of reappearances of an initial patch of tiles. Using derived Vorono? tilings, we obtain a sufficient condition for a tiling to be combinatorially substitutive.     

Isohedral Polyomino Tiling of the Plane

A polynomial time algorithm is given for deciding, for a given polyomino P , whether there exists an isohedral tiling of the Euclidean plane by isometric copies of P . The decidability question for general tilings by copies of a single polyomino, or even periodic tilings by copies of a single polyomino, remains open. Received June 23, 1997, and in revised form April 6, 1998.     

A Framework for the Construction of Self-replicating Tilings

Dekking (Adv. Math. 44:78–104, 1982; J. Comb. Theory Ser. A 32:315–320, 1982) provided an important method to compute the boundaries of lattice rep-tiles as a ‘recurrent set’ on a free group of a finite alphabet. That is, those tilings are generated by lattice translations of a single tile, and there is an expanding linear map that carries tiles to unions of tiles. The boundary of the tile is identified with a sequence of words in the alphabet obtained from an expanding endomorphism (substitution) on the alphabet. In this paper, Dekking’s construction is generalized to address tilings with more than one tile, and to have the elements of the tilings be generated by both translation and rotations. Examples that fall within the scope of our main result include self-replicating multi-tiles, self-replicating tiles for crystallographic tilings and aperiodic tilings.     

Variations on Tilings in the Manhattan Metric

We investigate tilings of the integer lattice in the Euclidean n-dimensional space. The tiles considered here are the union of spheres defined by the Manhattan metric. We give a necessary condition for the existence of such a tiling for Z ⁿ when n 2. We prove that this condition is sufficient when n=2. Finally, we give some tilings of Z ⁿ when n 3.     

Fractal Penrose tilings I. Construction and matching rules

Summary Quasiperiodic tilings of kite-and-dart type, widely used as models for quasicrystals with decagonal symmetry, are constructed by means of somewhat artificial matching rules for the tiles. The proof of aperiodicity uses a self-similarity property, or inflation procedure, which requires drawing auxiliary lines. We introduce a modification of the kite-and-dart tilings which comes very naturally with both properties: the tiles are strictly self-similar, and their fractal boundaries provide perfect matching rules.     

Parallelogram Tilings, Worms, and Finite Orientations

This paper studies properties of tilings of the plane by parallelograms. In particular, it is established that in parallelogram tilings using a finite number of shapes all tiles occur in only finitely many orientations.     

Some Generalizations of the Pinwheel Tiling

We introduce a new family of nonperiodic tilings, based on a substitution rule that generalizes the pinwheel tiling of Conway and Radin. In each tiling the tiles are similar to a single triangular prototile. In a countable number of cases, the tiles appear in a finite number of sizes and an infinite number of orientations. These tilings generally do not meet full-edge to full-edge, but can be forced through local matching rules. In a countable number of cases, the tiles appear in a finite number of orientations but an infinite number of sizes, all within a set range, while in an uncountable number of cases both the number of sizes and the number of orientations is infinite. Received April 9, 1996, and in revised form September 16, 1996.     

Self-Similar Lattice Tilings

We study the general question of the existence of self-similar lattice tilings of Euclidean space. A necessary and sufficient geometric condition on the growth of the boundary of approximate tiles is reduced to a problem in Fourier analysis that is shown to have an elegant simple solution in dimension one. In dimension two we further prove the existence of connected self-similar lattice tilings for parabolic and elliptic dilations. These results apply to produce Haar wavelet bases and certain canonical number systems.     

Convex pentagons that admit <Emphasis Type="Italic">i</Emphasis>-block transitive tilings

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 these types admit tile-transitive tilings (i.e. there is a single transitivity class with respect to the symmetry group of the tiling). The remaining 9 types do not admit tile-transitive tilings, but do admit either 2-block transitive tilings or 3-block transitive tilings; these are tilings comprised of clusters of 2 or 3 pentagons such that these clusters form tile-2-transitive or tile-3-transitive tilings. In this article, we present some combinatorial results concerning pentagons that admit i-block transitive tilings for \(i \in \mathbb {N}\). These results form the basis for an automated approach to finding all pentagons that admit i-block transitive tilings for each \(i \in \mathbb {N}\). We will present the methods of this algorithm and the results of the computer searches so far, which includes a complete classification of all pentagons admitting i-block transitive tilings for \(i \le 4\), among which is a new 15th type of convex pentagon that admits a tile-3-transitive tiling.     

The boundary characteristic and Pick's theorem in the Archimedean planar tilings

The tiling of the plane by unit squares is only one of the 11 Archimedean tilings which use regular polygons and have only one type of vertex. In this paper, the boundary characteristic of a lattice polygon is defined for every Archimedean tiling, and related enumeration formulae are found. Pick's theorem (on the area of a lattice polygon in the tilling by squares) is then generalized for lattice polygons in each of the Archimedean tilings, by enumerating the number of tiles of each type in the polygon.