Related papers: Categorical Tiling Theory: Constructing Directed P…
We study the construction of substitution tilings of the plane based on certain simplicial configurations of tangents of the deltoid with evenly distributed orientations. The random tiling ensembles are obtained as a result of tile…
The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…
We describe families of plane-filling curves on any edge-to-edge tiling of the plane with regular polygons and finitely many classes of edges. It is shown how to partition the minimal number of edge classes from the group G of symmetries of…
If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…
We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…
We show that the problem of tiling the Euclidean plane with a finite set of polygons (up to translation) boils down to prove the existence of zeros of a non-negative convex function defined on a finite-dimensional simplex. This function is…
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…
The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with any irrational angle in degree: they are three $1$-parameter families of pentagonal subdivisions of the Platonic solids, with…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
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…
Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…
We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…
We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
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…